Base | Representation |
---|---|
bin | 1001000110000101010100… |
… | …0100100000011101101111 |
3 | 1022102000000221022020002112 |
4 | 2101201111010200131233 |
5 | 2302320211421004444 |
6 | 33133553154314235 |
7 | 2051325034641203 |
oct | 221412504403557 |
9 | 38360027266075 |
10 | 10000111109999 |
11 | 320602902366a |
12 | 1156108b8897b |
13 | 57701118bb9a |
14 | 268017bb2b03 |
15 | 1251d4a8e69e |
hex | 9185512076f |
10000111109999 has 2 divisors, whose sum is σ = 10000111110000. Its totient is φ = 10000111109998.
The previous prime is 10000111109939. The next prime is 10000111110001. The reversal of 10000111109999 is 99990111100001.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10000111109999 - 28 = 10000111109743 is a prime.
Together with 10000111110001, 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 (10000111109939) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000055554999 + 5000055555000.
It is an arithmetic number, because the mean of its divisors is an integer number (5000055555000).
Almost surely, 210000111109999 is an apocalyptic number.
10000111109999 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000111109999 is an equidigital number, since it uses as much as digits as its factorization.
10000111109999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6561, while the sum is 41.
The spelling of 10000111109999 in words is "ten trillion, one hundred eleven million, one hundred nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •