Base | Representation |
---|---|
bin | 10110101111001101010010… |
… | …101001010011001100100001 |
3 | 111010002000100022012000022021 |
4 | 112233031102221103030201 |
5 | 101101404233142023014 |
6 | 552403513100141441 |
7 | 30030561506006422 |
oct | 2657152251231441 |
9 | 433060308160267 |
10 | 100001110111009 |
11 | 299552616a7a98 |
12 | b270a75537881 |
13 | 43a50ab126b73 |
14 | 1a9a118423649 |
15 | b863d1ea1624 |
hex | 5af352a53321 |
100001110111009 has 2 divisors, whose sum is σ = 100001110111010. Its totient is φ = 100001110111008.
The previous prime is 100001110110977. The next prime is 100001110111031. The reversal of 100001110111009 is 900111011100001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 76915583643409 + 23085526467600 = 8770153^2 + 4804740^2 .
It is a cyclic number.
It is not a de Polignac number, because 100001110111009 - 25 = 100001110110977 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100001110110983 and 100001110111001.
It is not a weakly prime, because it can be changed into another prime (100001110111079) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000555055504 + 50000555055505.
It is an arithmetic number, because the mean of its divisors is an integer number (50000555055505).
Almost surely, 2100001110111009 is an apocalyptic number.
It is an amenable number.
100001110111009 is a deficient number, since it is larger than the sum of its proper divisors (1).
100001110111009 is an equidigital number, since it uses as much as digits as its factorization.
100001110111009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 16.
The spelling of 100001110111009 in words is "one hundred trillion, one billion, one hundred ten million, one hundred eleven thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •