Base | Representation |
---|---|
bin | 11010000111101010… |
… | …110011010001100000 |
3 | 2200101120101202221211 |
4 | 122013222303101200 |
5 | 424414230314000 |
6 | 20514545555504 |
7 | 2012001424150 |
oct | 320752632140 |
9 | 80346352854 |
10 | 28045948000 |
11 | 1099222a924 |
12 | 5528645b94 |
13 | 284c5b7a05 |
14 | 1500b10760 |
15 | ae22e07ba |
hex | 687ab3460 |
28045948000 has 384 divisors, whose sum is σ = 82523750400. Its totient is φ = 9165312000.
The previous prime is 28045947997. The next prime is 28045948001. The reversal of 28045948000 is 84954082.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28045948001) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 68571796 + ... + 68572204.
It is an arithmetic number, because the mean of its divisors is an integer number (214905600).
Almost surely, 228045948000 is an apocalyptic number.
28045948000 is a gapful number since it is divisible by the number (20) 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 28045948000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41261875200).
28045948000 is an abundant number, since it is smaller than the sum of its proper divisors (54477802400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28045948000 is a wasteful number, since it uses less digits than its factorization.
28045948000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 551 (or 533 counting only the distinct ones).
The product of its (nonzero) digits is 92160, while the sum is 40.
The spelling of 28045948000 in words is "twenty-eight billion, forty-five million, nine hundred forty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •