Base | Representation |
---|---|
bin | 10010110100001001… |
… | …10000001100010000 |
3 | 222001222001120101221 |
4 | 21122010300030100 |
5 | 131141342130000 |
6 | 4350154134424 |
7 | 505213121413 |
oct | 113204601420 |
9 | 28058046357 |
10 | 10101130000 |
11 | 4313908525 |
12 | 1b5aa21414 |
13 | c4c938400 |
14 | 6bb769b7a |
15 | 3e1bd761a |
hex | 25a130310 |
10101130000 has 300 divisors, whose sum is σ = 27292576080. Its totient is φ = 3616704000.
The previous prime is 10101129991. The next prime is 10101130007. The reversal of 10101130000 is 3110101.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (10101130007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 72669931 + ... + 72670069.
Almost surely, 210101130000 is an apocalyptic number.
10101130000 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 10101130000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13646288040).
10101130000 is an abundant number, since it is smaller than the sum of its proper divisors (17191446080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10101130000 is a wasteful number, since it uses less digits than its factorization.
10101130000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236 (or 202 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 7.
Adding to 10101130000 its reverse (3110101), we get a palindrome (10104240101).
The spelling of 10101130000 in words is "ten billion, one hundred one million, one hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •