Base | Representation |
---|---|
bin | 1000111010001010110… |
… | …0101101100010010000 |
3 | 112122001120010122010000 |
4 | 2032202230231202100 |
5 | 10001423143011300 |
6 | 154151203210000 |
7 | 14025544105320 |
oct | 2164254554220 |
9 | 478046118100 |
10 | 153053485200 |
11 | 59a0077a840 |
12 | 257b5376900 |
13 | 1158206c535 |
14 | 759d11b280 |
15 | 3eabbdac00 |
hex | 23a2b2d890 |
153053485200 has 1200 divisors, whose sum is σ = 707286159360. Its totient is φ = 30761856000.
The previous prime is 153053485183. The next prime is 153053485219. The reversal of 153053485200 is 2584350351.
153053485200 is a `hidden beast` number, since 1 + 5 + 305 + 348 + 5 + 2 + 0 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (1200).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 239 ways as a sum of consecutive naturals, for example, 77337811 + ... + 77339789.
Almost surely, 2153053485200 is an apocalyptic number.
153053485200 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 153053485200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (353643079680).
153053485200 is an abundant number, since it is smaller than the sum of its proper divisors (554232674160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153053485200 is a wasteful number, since it uses less digits than its factorization.
153053485200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2058 (or 2038 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 36.
The spelling of 153053485200 in words is "one hundred fifty-three billion, fifty-three million, four hundred eighty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •