Base | Representation |
---|---|
bin | 11010101100001111… |
… | …110010000000000000 |
3 | 2201222100010122021100 |
4 | 122230033302000000 |
5 | 432143330400023 |
6 | 21055511054400 |
7 | 2033132523642 |
oct | 325417620000 |
9 | 81870118240 |
10 | 28659621888 |
11 | 11177678127 |
12 | 567a071400 |
13 | 2919790461 |
14 | 155c416892 |
15 | b2b10ec43 |
hex | 6ac3f2000 |
28659621888 has 336 divisors, whose sum is σ = 89451180000. Its totient is φ = 8811970560.
The previous prime is 28659621871. The next prime is 28659621889. The reversal of 28659621888 is 88812695682.
28659621888 is a `hidden beast` number, since 28 + 6 + 596 + 2 + 18 + 8 + 8 = 666.
It is not an unprimeable number, because it can be changed into a prime (28659621889) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 57433863 + ... + 57434361.
It is an arithmetic number, because the mean of its divisors is an integer number (266223750).
Almost surely, 228659621888 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 28659621888, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44725590000).
28659621888 is an abundant number, since it is smaller than the sum of its proper divisors (60791558112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28659621888 is a wasteful number, since it uses less digits than its factorization.
28659621888 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 591 (or 564 counting only the distinct ones).
The product of its digits is 26542080, while the sum is 63.
The spelling of 28659621888 in words is "twenty-eight billion, six hundred fifty-nine million, six hundred twenty-one thousand, eight hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •