Base | Representation |
---|---|
bin | 110011001001000010… |
… | …111000110100101000 |
3 | 12020201221201100100110 |
4 | 303021002320310220 |
5 | 1344430110210000 |
6 | 41120531134320 |
7 | 3652533162000 |
oct | 631102706450 |
9 | 166657640313 |
10 | 54912585000 |
11 | 213197a4959 |
12 | a7861443a0 |
13 | 5241773160 |
14 | 292cd59000 |
15 | 1665cd0850 |
hex | cc90b8d28 |
54912585000 has 640 divisors, whose sum is σ = 215705952000. Its totient is φ = 11571840000.
The previous prime is 54912584959. The next prime is 54912585059. The reversal of 54912585000 is 58521945.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 54912585000.
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 66884590 + ... + 66885410.
It is an arithmetic number, because the mean of its divisors is an integer number (337040550).
Almost surely, 254912585000 is an apocalyptic number.
54912585000 is a gapful number since it is divisible by the number (50) 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 54912585000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107852976000).
54912585000 is an abundant number, since it is smaller than the sum of its proper divisors (160793367000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54912585000 is a wasteful number, since it uses less digits than its factorization.
54912585000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 884 (or 851 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 39.
The spelling of 54912585000 in words is "fifty-four billion, nine hundred twelve million, five hundred eighty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •