Base | Representation |
---|---|
bin | 11010100101110111… |
… | …001010001001001010 |
3 | 2201200212120110222210 |
4 | 122211313022021022 |
5 | 431433420111012 |
6 | 21041123125550 |
7 | 2030362164360 |
oct | 324567121112 |
9 | 81625513883 |
10 | 28552503882 |
11 | 11122164851 |
12 | 564a2138b6 |
13 | 2900526b16 |
14 | 154c0d1630 |
15 | b21a0123c |
hex | 6a5dca24a |
28552503882 has 64 divisors (see below), whose sum is σ = 66480390144. Its totient is φ = 8006705280.
The previous prime is 28552503877. The next prime is 28552503887. The reversal of 28552503882 is 28830525582.
It is an interprime number because it is at equal distance from previous prime (28552503877) and next prime (28552503887).
It is not an unprimeable number, because it can be changed into a prime (28552503887) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 643518 + ... + 686454.
It is an arithmetic number, because the mean of its divisors is an integer number (1038756096).
Almost surely, 228552503882 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 28552503882, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33240195072).
28552503882 is an abundant number, since it is smaller than the sum of its proper divisors (37927886262).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28552503882 is a wasteful number, since it uses less digits than its factorization.
28552503882 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43243.
The product of its (nonzero) digits is 1536000, while the sum is 48.
The spelling of 28552503882 in words is "twenty-eight billion, five hundred fifty-two million, five hundred three thousand, eight hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •