Base | Representation |
---|---|
bin | 10011010100110100101100 |
3 | 100112101021200 |
4 | 103110310230 |
5 | 2244103103 |
6 | 300325500 |
7 | 61026522 |
oct | 23246454 |
9 | 10471250 |
10 | 5066028 |
11 | 2950200 |
12 | 1843890 |
13 | 1084b66 |
14 | 95c312 |
15 | 6a10a3 |
hex | 4d4d2c |
5066028 has 54 divisors (see below), whose sum is σ = 14087892. Its totient is φ = 1533840.
The previous prime is 5066021. The next prime is 5066029. The reversal of 5066028 is 8206605.
5066028 is a `hidden beast` number, since 50 + 6 + 602 + 8 = 666.
5066028 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 5065992 and 5066010.
It is not an unprimeable number, because it can be changed into a prime (5066021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 3775 + ... + 4937.
Almost surely, 25066028 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 5066028, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7043946).
5066028 is an abundant number, since it is smaller than the sum of its proper divisors (9021864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5066028 is a wasteful number, since it uses less digits than its factorization.
5066028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1195 (or 1179 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The square root of 5066028 is about 2250.7838634574. The cubic root of 5066028 is about 171.7470140528.
The spelling of 5066028 in words is "five million, sixty-six thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •