Base | Representation |
---|---|
bin | 1001001011111001011110… |
… | …1000100111111111111111 |
3 | 1022202112220012200110111011 |
4 | 2102332113220213333333 |
5 | 2310434311100401421 |
6 | 33251514223540051 |
7 | 2061462500351242 |
oct | 222762750477777 |
9 | 38675805613434 |
10 | 10100012122111 |
11 | 324443359969a |
12 | 117154975a627 |
13 | 5835723206c2 |
14 | 26cbb3a27259 |
15 | 127ad02744e1 |
hex | 92f97a27fff |
10100012122111 has 8 divisors (see below), whose sum is σ = 10105174187264. Its totient is φ = 10094850457560.
The previous prime is 10100012122097. The next prime is 10100012122129. The reversal of 10100012122111 is 11122121000101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10100012122111 - 223 = 10100003733503 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10100012122091 and 10100012122100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10100012125111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 59205640 + ... + 59375986.
It is an arithmetic number, because the mean of its divisors is an integer number (1263146773408).
Almost surely, 210100012122111 is an apocalyptic number.
10100012122111 is a deficient number, since it is larger than the sum of its proper divisors (5162065153).
10100012122111 is a wasteful number, since it uses less digits than its factorization.
10100012122111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 200301.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10100012122111 its reverse (11122121000101), we get a palindrome (21222133122212).
The spelling of 10100012122111 in words is "ten trillion, one hundred billion, twelve million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •