Base | Representation |
---|---|
bin | 110110000010… |
… | …1010111011010 |
3 | 1222022111022000 |
4 | 1230011113122 |
5 | 24223133110 |
6 | 2451141430 |
7 | 462555021 |
oct | 154052732 |
9 | 58274260 |
10 | 28333530 |
11 | 14aa2445 |
12 | 95a4876 |
13 | 5b40604 |
14 | 3a978b8 |
15 | 274a1c0 |
hex | 1b055da |
28333530 has 64 divisors (see below), whose sum is σ = 76377600. Its totient is φ = 7473600.
The previous prime is 28333523. The next prime is 28333553. The reversal of 28333530 is 3533382.
It is a happy number.
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 = 28333494 and 28333503.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 26751 + ... + 27789.
It is an arithmetic number, because the mean of its divisors is an integer number (1193400).
Almost surely, 228333530 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 28333530, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38188800).
28333530 is an abundant number, since it is smaller than the sum of its proper divisors (48044070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28333530 is a wasteful number, since it uses less digits than its factorization.
28333530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1156 (or 1150 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
The square root of 28333530 is about 5322.9249478083. The cubic root of 28333530 is about 304.8598478178.
The spelling of 28333530 in words is "twenty-eight million, three hundred thirty-three thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •