Base | Representation |
---|---|
bin | 1001001101001000000101… |
… | …0011000010101111100011 |
3 | 1022211120100201012120221022 |
4 | 2103102001103002233203 |
5 | 2311311014210432321 |
6 | 33305324051520055 |
7 | 2063140411153613 |
oct | 223220123025743 |
9 | 38746321176838 |
10 | 10121112202211 |
11 | 3252380a8811a |
12 | 1175657bb902b |
13 | 5855558a65ba |
14 | 26dc1606ca43 |
15 | 12841788edab |
hex | 934814c2be3 |
10121112202211 has 32 divisors (see below), whose sum is σ = 10719450897408. Its totient is φ = 9545811690240.
The previous prime is 10121112202207. The next prime is 10121112202217. The reversal of 10121112202211 is 11220221112101.
It is a cyclic number.
It is not a de Polignac number, because 10121112202211 - 22 = 10121112202207 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 10121112202211.
It is not an unprimeable number, because it can be changed into a prime (10121112202217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 45018821 + ... + 45243081.
It is an arithmetic number, because the mean of its divisors is an integer number (334982840544).
Almost surely, 210121112202211 is an apocalyptic number.
10121112202211 is a deficient number, since it is larger than the sum of its proper divisors (598338695197).
10121112202211 is a wasteful number, since it uses less digits than its factorization.
10121112202211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224651.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 10121112202211 its reverse (11220221112101), we get a palindrome (21341333314312).
The spelling of 10121112202211 in words is "ten trillion, one hundred twenty-one billion, one hundred twelve million, two hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •