Base | Representation |
---|---|
bin | 1001000110001101001011… |
… | …0001010010011101010111 |
3 | 1022102012110220112222211202 |
4 | 2101203102301102131113 |
5 | 2302334021310013421 |
6 | 33134542331223115 |
7 | 2051431223135612 |
oct | 221432261223527 |
9 | 38365426488752 |
10 | 10002220001111 |
11 | 3206a10484788 |
12 | 11565b72a7a9b |
13 | 577289070950 |
14 | 268177cd5179 |
15 | 1252a9cb110b |
hex | 918d2c52757 |
10002220001111 has 16 divisors (see below), whose sum is σ = 11035508045184. Its totient is φ = 9007869425664.
The previous prime is 10002220001087. The next prime is 10002220001149. The reversal of 10002220001111 is 11110002220001.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10002220001111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10002220001092 and 10002220001101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002220001311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25626890 + ... + 26014263.
It is an arithmetic number, because the mean of its divisors is an integer number (689719252824).
Almost surely, 210002220001111 is an apocalyptic number.
10002220001111 is a deficient number, since it is larger than the sum of its proper divisors (1033288044073).
10002220001111 is a wasteful number, since it uses less digits than its factorization.
10002220001111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51641530.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10002220001111 its reverse (11110002220001), we get a palindrome (21112222221112).
It can be divided in two parts, 10002220001 and 111, that multiplied together give a palindrome (1110246420111).
The spelling of 10002220001111 in words is "ten trillion, two billion, two hundred twenty million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •