Base | Representation |
---|---|
bin | 11001010000110111010000… |
… | …101011010101001001010001 |
3 | 112120102000100122012020022211 |
4 | 121100313100223111021101 |
5 | 104030411300024444303 |
6 | 1032151122310232121 |
7 | 32255301425035456 |
oct | 3120672053251121 |
9 | 476360318166284 |
10 | 111110009999953 |
11 | 32448544016318 |
12 | 10565a45655641 |
13 | 49cc823b58713 |
14 | 1d61a78a1182d |
15 | cca35dd9966d |
hex | 650dd0ad5251 |
111110009999953 has 2 divisors, whose sum is σ = 111110009999954. Its totient is φ = 111110009999952.
The previous prime is 111110009999897. The next prime is 111110009999957. The reversal of 111110009999953 is 359999900011111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 63403126161664 + 47706883838289 = 7962608^2 + 6907017^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111110009999953 is a prime.
It is not a weakly prime, because it can be changed into another prime (111110009999957) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55555004999976 + 55555004999977.
It is an arithmetic number, because the mean of its divisors is an integer number (55555004999977).
Almost surely, 2111110009999953 is an apocalyptic number.
It is an amenable number.
111110009999953 is a deficient number, since it is larger than the sum of its proper divisors (1).
111110009999953 is an equidigital number, since it uses as much as digits as its factorization.
111110009999953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 885735, while the sum is 58.
The spelling of 111110009999953 in words is "one hundred eleven trillion, one hundred ten billion, nine million, nine hundred ninety-nine thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •