Base | Representation |
---|---|
bin | 1110111101000101101100… |
… | …1001011010000001000111 |
3 | 2011012220101112012000102002 |
4 | 3233101123021122001013 |
5 | 4123344033441022412 |
6 | 54545353333535515 |
7 | 3314641353653024 |
oct | 357213311320107 |
9 | 64186345160362 |
10 | 16442664001607 |
11 | 526a327195728 |
12 | 1a16846aa459b |
13 | 9236c8a9a2cc |
14 | 40bb873d054b |
15 | 1d7aa10cedc2 |
hex | ef45b25a047 |
16442664001607 has 2 divisors, whose sum is σ = 16442664001608. Its totient is φ = 16442664001606.
The previous prime is 16442664001559. The next prime is 16442664001609. The reversal of 16442664001607 is 70610046624461.
16442664001607 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 16442664001607 - 210 = 16442664000583 is a prime.
It is a super-3 number, since 3×164426640016073 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 16442664001609, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16442664001609) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8221332000803 + 8221332000804.
It is an arithmetic number, because the mean of its divisors is an integer number (8221332000804).
Almost surely, 216442664001607 is an apocalyptic number.
16442664001607 is a deficient number, since it is larger than the sum of its proper divisors (1).
16442664001607 is an equidigital number, since it uses as much as digits as its factorization.
16442664001607 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1161216, while the sum is 47.
The spelling of 16442664001607 in words is "sixteen trillion, four hundred forty-two billion, six hundred sixty-four million, one thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •