Base | Representation |
---|---|
bin | 1001010011101011100… |
… | …1110000011100100000 |
3 | 120021201211211200210002 |
4 | 2110322321300130200 |
5 | 10104434403242440 |
6 | 201242530555132 |
7 | 14360343436340 |
oct | 2247271603440 |
9 | 507654750702 |
10 | 159902009120 |
11 | 618a5574167 |
12 | 26ba6a38aa8 |
13 | 12103b7a759 |
14 | 7a4c8c6d20 |
15 | 425d083115 |
hex | 253ae70720 |
159902009120 has 96 divisors (see below), whose sum is σ = 439881539328. Its totient is φ = 53789119488.
The previous prime is 159902009119. The next prime is 159902009131. The reversal of 159902009120 is 21900209951.
159902009120 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1599020091202 (a number of 23 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 1287524 + ... + 1406243.
It is an arithmetic number, because the mean of its divisors is an integer number (4582099368).
Almost surely, 2159902009120 is an apocalyptic number.
159902009120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
159902009120 is an abundant number, since it is smaller than the sum of its proper divisors (279979530208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
159902009120 is a wasteful number, since it uses less digits than its factorization.
159902009120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2693842 (or 2693834 counting only the distinct ones).
The product of its (nonzero) digits is 14580, while the sum is 38.
The spelling of 159902009120 in words is "one hundred fifty-nine billion, nine hundred two million, nine thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •