Base | Representation |
---|---|
bin | 10011010101000010010100 |
3 | 100112102110222 |
4 | 103111002110 |
5 | 2244120100 |
6 | 300333512 |
7 | 61032206 |
oct | 23250224 |
9 | 10472428 |
10 | 5066900 |
11 | 2950923 |
12 | 1844298 |
13 | 1085387 |
14 | 95c776 |
15 | 6a1485 |
hex | 4d5094 |
5066900 has 36 divisors (see below), whose sum is σ = 11478432. Its totient is φ = 1937760.
The previous prime is 5066881. The next prime is 5066921. The reversal of 5066900 is 96605.
It is a super-2 number, since 2×50669002 = 51346951220000, which contains 22 as substring.
It is a Smith number, since the sum of its digits (26) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 5066900.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1199 + ... + 3401.
Almost surely, 25066900 is an apocalyptic number.
5066900 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5066900, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5739216).
5066900 is an abundant number, since it is smaller than the sum of its proper divisors (6411532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5066900 is a wasteful number, since it uses less digits than its factorization.
5066900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2240 (or 2233 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 26.
The square root of 5066900 is about 2250.9775654146. The cubic root of 5066900 is about 171.7568675846.
The spelling of 5066900 in words is "five million, sixty-six thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •