Base | Representation |
---|---|
bin | 1001000110101010100111… |
… | …0001011010000101110111 |
3 | 1022102221212121202021012010 |
4 | 2101222221301122011313 |
5 | 2303001212224213421 |
6 | 33142330412455303 |
7 | 2052131104651206 |
oct | 221525161320567 |
9 | 38387777667163 |
10 | 10010122101111 |
11 | 320a2a5a65440 |
12 | 115804177a533 |
13 | 577c48227072 |
14 | 2686c759723d |
15 | 1255bd8be076 |
hex | 91aa9c5a177 |
10010122101111 has 32 divisors (see below), whose sum is σ = 14845239763200. Its totient is φ = 5949112366080.
The previous prime is 10010122101079. The next prime is 10010122101131. The reversal of 10010122101111 is 11110122101001.
10010122101111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10010122101111 - 25 = 10010122101079 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10010122101131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13995981 + ... + 14693798.
It is an arithmetic number, because the mean of its divisors is an integer number (463913742600).
Almost surely, 210010122101111 is an apocalyptic number.
10010122101111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10010122101111 is a deficient number, since it is larger than the sum of its proper divisors (4835117662089).
10010122101111 is a wasteful number, since it uses less digits than its factorization.
10010122101111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28689999.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 10010122101111 its reverse (11110122101001), we get a palindrome (21120244202112).
The spelling of 10010122101111 in words is "ten trillion, ten billion, one hundred twenty-two million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •