Base | Representation |
---|---|
bin | 1001010010011011011100… |
… | …1001111100011110001111 |
3 | 1100011021111110222021211211 |
4 | 2110212313021330132033 |
5 | 2314304101241200421 |
6 | 33415231411555251 |
7 | 2102544041416645 |
oct | 224466711743617 |
9 | 40137443867754 |
10 | 10212210100111 |
11 | 3287a79408148 |
12 | 118b2405bbb27 |
13 | 591012cc17b6 |
14 | 2743b8abd195 |
15 | 12a99a2d99e1 |
hex | 949b727c78f |
10212210100111 has 4 divisors (see below), whose sum is σ = 10812928341312. Its totient is φ = 9611491858912.
The previous prime is 10212210100093. The next prime is 10212210100151. The reversal of 10212210100111 is 11100101221201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10212210100111 - 27 = 10212210099983 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10212210100091 and 10212210100100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10212210100151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 300359120575 + ... + 300359120608.
It is an arithmetic number, because the mean of its divisors is an integer number (2703232085328).
Almost surely, 210212210100111 is an apocalyptic number.
10212210100111 is a deficient number, since it is larger than the sum of its proper divisors (600718241201).
10212210100111 is an equidigital number, since it uses as much as digits as its factorization.
10212210100111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 600718241200.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10212210100111 its reverse (11100101221201), we get a palindrome (21312311321312).
The spelling of 10212210100111 in words is "ten trillion, two hundred twelve billion, two hundred ten million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •