Base | Representation |
---|---|
bin | 1001000111010111100111… |
… | …0011000001111101111111 |
3 | 1022111010001111102220201022 |
4 | 2101311321303001331333 |
5 | 2303200432220401421 |
6 | 33152045221334355 |
7 | 2053036340306264 |
oct | 221657163017577 |
9 | 38433044386638 |
10 | 10022202122111 |
11 | 3214434901a73 |
12 | 115a4532673bb |
13 | 579121b2869a |
14 | 269111a8526b |
15 | 125a791997ab |
hex | 91d79cc1f7f |
10022202122111 has 8 divisors (see below), whose sum is σ = 10025600689104. Its totient is φ = 10018803968640.
The previous prime is 10022202122089. The next prime is 10022202122113. The reversal of 10022202122111 is 11122120222001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10022202122111 - 230 = 10021128380287 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10022202122111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10022202122113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 52914200 + ... + 53103266.
It is an arithmetic number, because the mean of its divisors is an integer number (1253200086138).
Almost surely, 210022202122111 is an apocalyptic number.
10022202122111 is a deficient number, since it is larger than the sum of its proper divisors (3398566993).
10022202122111 is a wasteful number, since it uses less digits than its factorization.
10022202122111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206761.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 10022202122111 its reverse (11122120222001), we get a palindrome (21144322344112).
The spelling of 10022202122111 in words is "ten trillion, twenty-two billion, two hundred two million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •