Base | Representation |
---|---|
bin | 1000111010010010100… |
… | …0010000000000000000 |
3 | 112122010211001221211000 |
4 | 2032210220100000000 |
5 | 10002004440320310 |
6 | 154154321252000 |
7 | 14026416266013 |
oct | 2164450200000 |
9 | 478124057730 |
10 | 153085870080 |
11 | 59a17a8a000 |
12 | 25804194000 |
13 | 1158899aba0 |
14 | 75a354b37a |
15 | 3eae9864c0 |
hex | 23a4a10000 |
153085870080 has 1088 divisors, whose sum is σ = 644743491840. Its totient is φ = 34256977920.
The previous prime is 153085870061. The next prime is 153085870109. The reversal of 153085870080 is 80078580351.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 11775836154 + ... + 11775836166.
Almost surely, 2153085870080 is an apocalyptic number.
153085870080 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 153085870080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (322371745920).
153085870080 is an abundant number, since it is smaller than the sum of its proper divisors (491657621760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153085870080 is an frugal number, since it uses more digits than its factorization.
153085870080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92 (or 34 counting only the distinct ones).
The product of its (nonzero) digits is 268800, while the sum is 45.
It can be divided in two parts, 153085 and 870080, that added together give a triangular number (1023165 = T1430).
The spelling of 153085870080 in words is "one hundred fifty-three billion, eighty-five million, eight hundred seventy thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •