Base | Representation |
---|---|
bin | 11010011101111101… |
… | …111011001110000000 |
3 | 2201100122100122012000 |
4 | 122131331323032000 |
5 | 431201013410112 |
6 | 21020032304000 |
7 | 2024163344610 |
oct | 323575731600 |
9 | 81318318160 |
10 | 28420060032 |
11 | 11064423821 |
12 | 56119a2000 |
13 | 28abc63b90 |
14 | 1538696a40 |
15 | b1508d7dc |
hex | 69df7b380 |
28420060032 has 512 divisors, whose sum is σ = 107751168000. Its totient is φ = 7167688704.
The previous prime is 28420060007. The next prime is 28420060091. The reversal of 28420060032 is 23006002482.
28420060032 is a `hidden beast` number, since 2 + 8 + 4 + 20 + 0 + 600 + 32 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 28420059978 and 28420060005.
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, 7231444 + ... + 7235372.
It is an arithmetic number, because the mean of its divisors is an integer number (210451500).
Almost surely, 228420060032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 28420060032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (53875584000).
28420060032 is an abundant number, since it is smaller than the sum of its proper divisors (79331107968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28420060032 is a wasteful number, since it uses less digits than its factorization.
28420060032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3995 (or 3977 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
The spelling of 28420060032 in words is "twenty-eight billion, four hundred twenty million, sixty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •