Base | Representation |
---|---|
bin | 101111000110100110… |
… | …0110101011110000000 |
3 | 100200002112120222020211 |
4 | 1132031030311132000 |
5 | 3124130204400000 |
6 | 114245200043504 |
7 | 10210446004426 |
oct | 1361514653600 |
9 | 320075528224 |
10 | 101153200000 |
11 | 39998387356 |
12 | 17730003594 |
13 | 97006c91c8 |
14 | 4c7828b116 |
15 | 29705cd7ba |
hex | 178d335780 |
101153200000 has 192 divisors, whose sum is σ = 257780532240. Its totient is φ = 39513600000.
The previous prime is 101153199949. The next prime is 101153200051. The reversal of 101153200000 is 2351101.
It is an interprime number because it is at equal distance from previous prime (101153199949) and next prime (101153200051).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17197060 + ... + 17202940.
Almost surely, 2101153200000 is an apocalyptic number.
101153200000 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 101153200000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (128890266120).
101153200000 is an abundant number, since it is smaller than the sum of its proper divisors (156627332240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101153200000 is an frugal number, since it uses more digits than its factorization.
101153200000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5963 (or 5931 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 13.
Adding to 101153200000 its reverse (2351101), we get a palindrome (101155551101).
The spelling of 101153200000 in words is "one hundred one billion, one hundred fifty-three million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.263 sec. • engine limits •