Base | Representation |
---|---|
bin | 1000111010011010101… |
… | …1010000011000010100 |
3 | 112122020012200201202111 |
4 | 2032212223100120110 |
5 | 10002042233300000 |
6 | 154201545320404 |
7 | 14030314221463 |
oct | 2164653203024 |
9 | 478205621674 |
10 | 153120212500 |
11 | 59a35405a72 |
12 | 25813796104 |
13 | 11592b33548 |
14 | 75a7d2a9da |
15 | 3eb29bbcba |
hex | 23a6ad0614 |
153120212500 has 72 divisors (see below), whose sum is σ = 336939184512. Its totient is φ = 60880500000.
The previous prime is 153120212429. The next prime is 153120212519. The reversal of 153120212500 is 5212021351.
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, 2050825 + ... + 2124175.
It is an arithmetic number, because the mean of its divisors is an integer number (4679710896).
Almost surely, 2153120212500 is an apocalyptic number.
153120212500 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 153120212500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (168469592256).
153120212500 is an abundant number, since it is smaller than the sum of its proper divisors (183818972012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153120212500 is an equidigital number, since it uses as much as digits as its factorization.
153120212500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73547 (or 73525 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 22.
Adding to 153120212500 its reverse (5212021351), we get a palindrome (158332233851).
The spelling of 153120212500 in words is "one hundred fifty-three billion, one hundred twenty million, two hundred twelve thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •