Base | Representation |
---|---|
bin | 101111001000100110… |
… | …0011101100110100111 |
3 | 100200021012200111012211 |
4 | 1132101030131212213 |
5 | 3124244333223421 |
6 | 114255552224251 |
7 | 10212221412205 |
oct | 1362114354647 |
9 | 320235614184 |
10 | 101220211111 |
11 | 39a22196838 |
12 | 1774a53b087 |
13 | 971155c456 |
14 | 4c83132075 |
15 | 29764189e1 |
hex | 179131d9a7 |
101220211111 has 8 divisors (see below), whose sum is σ = 103407883200. Its totient is φ = 99033957888.
The previous prime is 101220211091. The next prime is 101220211121. The reversal of 101220211111 is 111112022101.
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 101220211111 - 27 = 101220210983 is a prime.
It is a super-2 number, since 2×1012202111112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101220211091 and 101220211100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101220211121) 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, 209866 + ... + 496471.
It is an arithmetic number, because the mean of its divisors is an integer number (12925985400).
Almost surely, 2101220211111 is an apocalyptic number.
101220211111 is a deficient number, since it is larger than the sum of its proper divisors (2187672089).
101220211111 is an equidigital number, since it uses as much as digits as its factorization.
101220211111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 709433.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101220211111 its reverse (111112022101), we get a palindrome (212332233212).
The spelling of 101220211111 in words is "one hundred one billion, two hundred twenty million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •