Base | Representation |
---|---|
bin | 101111000101000011… |
… | …0100011000100001111 |
3 | 100122221220210010020202 |
4 | 1132022012203010033 |
5 | 3124023403020421 |
6 | 114240102004115 |
7 | 10206245122523 |
oct | 1361206430417 |
9 | 318856703222 |
10 | 101101220111 |
11 | 39971004071 |
12 | 1771671663b |
13 | 96c29c9888 |
14 | 4c713d9d83 |
15 | 296ac6210b |
hex | 178a1a310f |
101101220111 has 16 divisors (see below), whose sum is σ = 106612247808. Its totient is φ = 95747097600.
The previous prime is 101101220069. The next prime is 101101220113. The reversal of 101101220111 is 111022101101.
It is a cyclic number.
It is not a de Polignac number, because 101101220111 - 234 = 83921350927 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101101220092 and 101101220101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101101220113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 236831 + ... + 508223.
It is an arithmetic number, because the mean of its divisors is an integer number (6663265488).
Almost surely, 2101101220111 is an apocalyptic number.
101101220111 is a deficient number, since it is larger than the sum of its proper divisors (5511027697).
101101220111 is a wasteful number, since it uses less digits than its factorization.
101101220111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271682.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101101220111 its reverse (111022101101), we get a palindrome (212123321212).
The spelling of 101101220111 in words is "one hundred one billion, one hundred one million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •