Base | Representation |
---|---|
bin | 1001001011111101100110… |
… | …1111011101111011001110 |
3 | 1022202122202111122001221112 |
4 | 2102333121233131323032 |
5 | 2310444044012241420 |
6 | 33252220243332022 |
7 | 2061532125433625 |
oct | 222773157357316 |
9 | 38678674561845 |
10 | 10101121212110 |
11 | 32449526523a5 |
12 | 11717b9081012 |
13 | 5836bb034986 |
14 | 26cc7b0506bc |
15 | 127b478038c5 |
hex | 92fd9bddece |
10101121212110 has 64 divisors (see below), whose sum is σ = 18444881952000. Its totient is φ = 3982406400000.
The previous prime is 10101121212109. The next prime is 10101121212131. The reversal of 10101121212110 is 1121212110101.
It is a super-2 number, since 2×101011212121102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1122217610 + ... + 1122226610.
It is an arithmetic number, because the mean of its divisors is an integer number (288201280500).
Almost surely, 210101121212110 is an apocalyptic number.
10101121212110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10101121212110 is a deficient number, since it is larger than the sum of its proper divisors (8343760739890).
10101121212110 is a wasteful number, since it uses less digits than its factorization.
10101121212110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13997.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 10101121212110 its reverse (1121212110101), we get a palindrome (11222333322211).
It can be divided in two parts, 1010112 and 1212110, that added together give a palindrome (2222222).
The spelling of 10101121212110 in words is "ten trillion, one hundred one billion, one hundred twenty-one million, two hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •