Base | Representation |
---|---|
bin | 101111001000100101… |
… | …1101010000101110000 |
3 | 100200021012021202210001 |
4 | 1132101023222011300 |
5 | 3124244310000422 |
6 | 114255543515344 |
7 | 10212216543100 |
oct | 1362113520560 |
9 | 320235252701 |
10 | 101220000112 |
11 | 39a22062260 |
12 | 1774a458b54 |
13 | 97114b73ba |
14 | 4c830b9200 |
15 | 29763c6227 |
hex | 17912ea170 |
101220000112 has 120 divisors (see below), whose sum is σ = 252282393072. Its totient is φ = 38895897600.
The previous prime is 101220000109. The next prime is 101220000121. The reversal of 101220000112 is 211000022101.
It is a super-3 number, since 3×1012200001123 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 549162 + ... + 709942.
Almost surely, 2101220000112 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 101220000112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126141196536).
101220000112 is an abundant number, since it is smaller than the sum of its proper divisors (151062392960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101220000112 is a wasteful number, since it uses less digits than its factorization.
101220000112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160887 (or 160874 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 101220000112 its reverse (211000022101), we get a palindrome (312220022213).
The spelling of 101220000112 in words is "one hundred one billion, two hundred twenty million, one hundred twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •