Base | Representation |
---|---|
bin | 1110111101000011011111… |
… | …1000000000001001101001 |
3 | 2011012211212021200020111102 |
4 | 3233100313320000021221 |
5 | 4123341330443033044 |
6 | 54545214514211145 |
7 | 3314620610022533 |
oct | 357206770001151 |
9 | 64184767606442 |
10 | 16442072236649 |
11 | 526a053151984 |
12 | 1a16700883ab5 |
13 | 9236332c5b27 |
14 | 40bb2c98c853 |
15 | 1d7a6918c24e |
hex | ef437e00269 |
16442072236649 has 2 divisors, whose sum is σ = 16442072236650. Its totient is φ = 16442072236648.
The previous prime is 16442072236631. The next prime is 16442072236663. The reversal of 16442072236649 is 94663227024461.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12394906009600 + 4047166227049 = 3520640^2 + 2011757^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16442072236649 is a prime.
It is a super-3 number, since 3×164420722366493 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 16442072236594 and 16442072236603.
It is not a weakly prime, because it can be changed into another prime (16442072236049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8221036118324 + 8221036118325.
It is an arithmetic number, because the mean of its divisors is an integer number (8221036118325).
Almost surely, 216442072236649 is an apocalyptic number.
It is an amenable number.
16442072236649 is a deficient number, since it is larger than the sum of its proper divisors (1).
16442072236649 is an equidigital number, since it uses as much as digits as its factorization.
16442072236649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20901888, while the sum is 56.
The spelling of 16442072236649 in words is "sixteen trillion, four hundred forty-two billion, seventy-two million, two hundred thirty-six thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •