Base | Representation |
---|---|
bin | 101111000101000001… |
… | …0101110111011010000 |
3 | 100122221211220022111202 |
4 | 1132022002232323100 |
5 | 3124023124020422 |
6 | 114240024330332 |
7 | 10206233456213 |
oct | 1361202567320 |
9 | 318854808452 |
10 | 101100220112 |
11 | 39970490821 |
12 | 177163139a8 |
13 | 96c2739668 |
14 | 4c7121977a |
15 | 296ab15b92 |
hex | 178a0aeed0 |
101100220112 has 60 divisors (see below), whose sum is σ = 205902995844. Its totient is φ = 48084410880.
The previous prime is 101100220079. The next prime is 101100220159. The reversal of 101100220112 is 211022001101.
It can be written as a sum of positive squares in 2 ways, for example, as 29819763856 + 71280456256 = 172684^2 + 266984^2 .
It is a junction number, because it is equal to n+sod(n) for n = 101100220093 and 101100220102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1498988 + ... + 1564980.
Almost surely, 2101100220112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101100220112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (102951497922).
101100220112 is an abundant number, since it is smaller than the sum of its proper divisors (104802775732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101100220112 is a wasteful number, since it uses less digits than its factorization.
101100220112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66228 (or 66199 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101100220112 its reverse (211022001101), we get a palindrome (312122221213).
The spelling of 101100220112 in words is "one hundred one billion, one hundred million, two hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •