Base | Representation |
---|---|
bin | 10010110101100001… |
… | …00001111100110000 |
3 | 222002202122121111222 |
4 | 21122300201330300 |
5 | 131202311343000 |
6 | 4351244124212 |
7 | 505412506220 |
oct | 113260417460 |
9 | 28082577458 |
10 | 10112606000 |
11 | 431a336622 |
12 | 1b62836668 |
13 | c52125a43 |
14 | 6bd0b6080 |
15 | 3e2c02a85 |
hex | 25ac21f30 |
10112606000 has 160 divisors (see below), whose sum is σ = 28016921088. Its totient is φ = 3458323200.
The previous prime is 10112605991. The next prime is 10112606003. The reversal of 10112606000 is 60621101.
It is a happy number.
It is a super-2 number, since 2×101126060002 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10112606000.
It is not an unprimeable number, because it can be changed into a prime (10112606003) 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, 7881359 + ... + 7882641.
Almost surely, 210112606000 is an apocalyptic number.
10112606000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10112606000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14008460544).
10112606000 is an abundant number, since it is smaller than the sum of its proper divisors (17904315088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10112606000 is a wasteful number, since it uses less digits than its factorization.
10112606000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1876 (or 1860 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
The spelling of 10112606000 in words is "ten billion, one hundred twelve million, six hundred six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •