Base | Representation |
---|---|
bin | 11010001100110110… |
… | …100100101011000000 |
3 | 2200121122001102010000 |
4 | 122030312210223000 |
5 | 430104011420000 |
6 | 20531334040000 |
7 | 2014105605633 |
oct | 321466445300 |
9 | 80548042100 |
10 | 28132920000 |
11 | 10a27333209 |
12 | 55517a9000 |
13 | 2864619633 |
14 | 150c4adc1a |
15 | ae9c70000 |
hex | 68cda4ac0 |
28132920000 has 700 divisors, whose sum is σ = 109934903320. Its totient is φ = 7091712000.
The previous prime is 28132919977. The next prime is 28132920007. The reversal of 28132920000 is 2923182.
It is a happy number.
It is a super-2 number, since 2×281329200002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (28132920007) by changing a digit.
It is a polite number, since it can be written in 99 ways as a sum of consecutive naturals, for example, 61559772 + ... + 61560228.
Almost surely, 228132920000 is an apocalyptic number.
28132920000 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 28132920000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (54967451660).
28132920000 is an abundant number, since it is smaller than the sum of its proper divisors (81801983320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28132920000 is an equidigital number, since it uses as much as digits as its factorization.
28132920000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 520 (or 486 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The spelling of 28132920000 in words is "twenty-eight billion, one hundred thirty-two million, nine hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •