Base | Representation |
---|---|
bin | 1100100000100… |
… | …1000010001000 |
3 | 10122201112112210 |
4 | 3020021002020 |
5 | 101412401200 |
6 | 5112305120 |
7 | 1204644342 |
oct | 310110210 |
9 | 118645483 |
10 | 52465800 |
11 | 27685372 |
12 | 156a21a0 |
13 | ab3c86a |
14 | 6d7a292 |
15 | 4915650 |
hex | 3209088 |
52465800 has 48 divisors (see below), whose sum is σ = 162645840. Its totient is φ = 13990720.
The previous prime is 52465799. The next prime is 52465801. The reversal of 52465800 is 856425.
It is an interprime number because it is at equal distance from previous prime (52465799) and next prime (52465801).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (52465801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 43122 + ... + 44321.
It is an arithmetic number, because the mean of its divisors is an integer number (3388455).
Almost surely, 252465800 is an apocalyptic number.
52465800 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
52465800 is an abundant number, since it is smaller than the sum of its proper divisors (110180040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52465800 is a wasteful number, since it uses less digits than its factorization.
52465800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87462 (or 87453 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 30.
The square root of 52465800 is about 7243.3279644097. The cubic root of 52465800 is about 374.3622939418.
The spelling of 52465800 in words is "fifty-two million, four hundred sixty-five thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •