- Euler's totient. Jordan's
totient is a
generalization of Euler's. The
cototient of n is
defined as n − φ(n). It
counts the
number of
positive integers...
- In
number theory, a
branch of mathematics, a
highly cototient number is a
positive integer k {\displaystyle k}
which is
above 1 and has more solutions...
-
first twelve integers 6081 - sum of the
first 54
primes 6089 –
highly cototient number 6095 –
magic constant of n × n
normal magic square and n-Queens...
- –
Proth prime, both a left- and right-truncatable
prime 3149 –
highly cototient number 3150 = 153 - 152 3155 –
member of the Mian–Chowla
sequence 3159...
- form 2p-1 5244 = 222 + 232 + … + 292 = 202 + 212 + … + 282 5249 –
highly cototient number 5253 –
triangular number 5279 –
Sophie Germain prime, twin prime...
- 299 is an odd
composite number with two
prime factors. 299 is a
highly cototient number,
meaning that it has more
values for x-phi(x)= that
number than...
- is the sum of
three consecutive primes (107 + 109 + 113), and a
highly cototient number. 330 = 2 × 3 × 5 × 11. 330 is sum of six
consecutive primes (43...
-
function zero 2099 –
Mertens function zero, super-prime, safe prime,
highly cototient number 2100 –
Mertens function zero 2101 –
centered heptagonal number...
-
tetrahedral number, a
pentagonal number, and a
pentatope number. 35 is a
highly cototient number,
since there are more
solutions to the
equation x − φ ( x ) = 35...
- nontotient,
totient sum for
first 45
integers 629 = 17 × 37,
highly cototient number,
Harshad number,
number of
diagonals in a 37-gon 630 = 2 × 32 ×...
