Base | Representation |
---|---|
bin | 1001001101001000011111… |
… | …0110101111000100011111 |
3 | 1022211120122101020011212102 |
4 | 2103102013312233010133 |
5 | 2311311230342101421 |
6 | 33305343021555315 |
7 | 2063143215260420 |
oct | 223220766570437 |
9 | 38746571204772 |
10 | 10121222222111 |
11 | 32524280a2760 |
12 | 1175688a15b3b |
13 | 585572617a30 |
14 | 26dc2690b647 |
15 | 12842237360b |
hex | 93487daf11f |
10121222222111 has 64 divisors (see below), whose sum is σ = 13756537331712. Its totient is φ = 7190769600000.
The previous prime is 10121222222107. The next prime is 10121222222117. The reversal of 10121222222111 is 11122222212101.
It is not a de Polignac number, because 10121222222111 - 22 = 10121222222107 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10121222222117) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 42444626 + ... + 42682416.
It is an arithmetic number, because the mean of its divisors is an integer number (214945895808).
Almost surely, 210121222222111 is an apocalyptic number.
10121222222111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10121222222111 is a deficient number, since it is larger than the sum of its proper divisors (3635315109601).
10121222222111 is a wasteful number, since it uses less digits than its factorization.
10121222222111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 238344.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 10121222222111 its reverse (11122222212101), we get a palindrome (21243444434212).
It can be divided in two parts, 101 and 21222222111, that added together give a palindrome (21222222212).
The spelling of 10121222222111 in words is "ten trillion, one hundred twenty-one billion, two hundred twenty-two million, two hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •