Base | Representation |
---|---|
bin | 1001001011111101111100… |
… | …0010001010101011101111 |
3 | 1022202122222200200222012000 |
4 | 2102333133002022223233 |
5 | 2310444234230000421 |
6 | 33252233134343343 |
7 | 2061534254221026 |
oct | 222773702125357 |
9 | 38678880628160 |
10 | 10101210000111 |
11 | 324499878610a |
12 | 117182295ab53 |
13 | 583703551059 |
14 | 26cc88b638bd |
15 | 127b504e1226 |
hex | 92fdf08aaef |
10101210000111 has 16 divisors (see below), whose sum is σ = 14978754434400. Its totient is φ = 6727840504704.
The previous prime is 10101210000029. The next prime is 10101210000223. The reversal of 10101210000111 is 11100001210101.
It is not a de Polignac number, because 10101210000111 - 213 = 10101209991919 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10101210000093 and 10101210000102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10101210000611) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 174956586 + ... + 175014311.
It is an arithmetic number, because the mean of its divisors is an integer number (936172152150).
Almost surely, 210101210000111 is an apocalyptic number.
10101210000111 is a deficient number, since it is larger than the sum of its proper divisors (4877544434289).
10101210000111 is a wasteful number, since it uses less digits than its factorization.
10101210000111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 349971975 (or 349971969 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10101210000111 its reverse (11100001210101), we get a palindrome (21201211210212).
The spelling of 10101210000111 in words is "ten trillion, one hundred one billion, two hundred ten million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •