Base | Representation |
---|---|
bin | 1001001011111101111100… |
… | …1010100110100000001011 |
3 | 1022202122222211212022020121 |
4 | 2102333133022212200023 |
5 | 2310444240311224321 |
6 | 33252233254004111 |
7 | 2061534312060262 |
oct | 222773712464013 |
9 | 38678884768217 |
10 | 10101212211211 |
11 | 3244999a56370 |
12 | 1171823646637 |
13 | 583703b465b4 |
14 | 26cc8917b5d9 |
15 | 127b507cb441 |
hex | 92fdf2a680b |
10101212211211 has 16 divisors (see below), whose sum is σ = 11133382065120. Its totient is φ = 9088026670080.
The previous prime is 10101212211163. The next prime is 10101212211239. The reversal of 10101212211211 is 11211221210101.
It is a cyclic number.
It is not a de Polignac number, because 10101212211211 - 233 = 10092622276619 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10101212211271) 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 in 15 ways as a sum of consecutive naturals, for example, 55594965 + ... + 55776361.
It is an arithmetic number, because the mean of its divisors is an integer number (695836379070).
Almost surely, 210101212211211 is an apocalyptic number.
10101212211211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10101212211211 is a deficient number, since it is larger than the sum of its proper divisors (1032169853909).
10101212211211 is a wasteful number, since it uses less digits than its factorization.
10101212211211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233694.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 10101212211211 its reverse (11211221210101), we get a palindrome (21312433421312).
The spelling of 10101212211211 in words is "ten trillion, one hundred one billion, two hundred twelve million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •