Base | Representation |
---|---|
bin | 10110101111001110001000… |
… | …010110110000110001110111 |
3 | 111010002002200002210010222111 |
4 | 112233032020112300301313 |
5 | 101101413104333033421 |
6 | 552404142330111451 |
7 | 30030623030220526 |
oct | 2657161026606167 |
9 | 433062602703874 |
10 | 100002011221111 |
11 | 2995568431838a |
12 | b27108727b587 |
13 | 43a51c2a1b8cc |
14 | 1a9a1a1d8c4bd |
15 | b8643614bee1 |
hex | 5af3885b0c77 |
100002011221111 has 2 divisors, whose sum is σ = 100002011221112. Its totient is φ = 100002011221110.
The previous prime is 100002011221061. The next prime is 100002011221157. The reversal of 100002011221111 is 111122110200001.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100002011221111 - 29 = 100002011220599 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100002011221091 and 100002011221100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100002011281111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50001005610555 + 50001005610556.
It is an arithmetic number, because the mean of its divisors is an integer number (50001005610556).
Almost surely, 2100002011221111 is an apocalyptic number.
100002011221111 is a deficient number, since it is larger than the sum of its proper divisors (1).
100002011221111 is an equidigital number, since it uses as much as digits as its factorization.
100002011221111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 100002011221111 its reverse (111122110200001), we get a palindrome (211124121421112).
The spelling of 100002011221111 in words is "one hundred trillion, two billion, eleven million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •