Base | Representation |
---|---|
bin | 1001000110110010000011… |
… | …1011011001110101100011 |
3 | 1022110011000221102112022220 |
4 | 2101230200323121311203 |
5 | 2303014311012211321 |
6 | 33143301024402123 |
7 | 2052231461052501 |
oct | 221544073316543 |
9 | 38404027375286 |
10 | 10012121210211 |
11 | 321013145371a |
12 | 11584bb176343 |
13 | 5781a644ba63 |
14 | 268836c9d671 |
15 | 1256891579c6 |
hex | 91b20ed9d63 |
10012121210211 has 32 divisors (see below), whose sum is σ = 14218740544320. Its totient is φ = 6244801941504.
The previous prime is 10012121210209. The next prime is 10012121210219. The reversal of 10012121210211 is 11201212121001.
It is a happy number.
10012121210211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10012121210211 - 21 = 10012121210209 is a prime.
It is a super-2 number, since 2×100121212102112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10012121210219) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 57023625 + ... + 57198933.
It is an arithmetic number, because the mean of its divisors is an integer number (444335642010).
Almost surely, 210012121210211 is an apocalyptic number.
10012121210211 is a deficient number, since it is larger than the sum of its proper divisors (4206619334109).
10012121210211 is a wasteful number, since it uses less digits than its factorization.
10012121210211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 181975.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10012121210211 its reverse (11201212121001), we get a palindrome (21213333331212).
The spelling of 10012121210211 in words is "ten trillion, twelve billion, one hundred twenty-one million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •