Base | Representation |
---|---|
bin | 1100011100101… |
… | …0100000100000 |
3 | 10122020112020110 |
4 | 3013022200200 |
5 | 101331202241 |
6 | 5103011320 |
7 | 1202526600 |
oct | 307124040 |
9 | 118215213 |
10 | 52209696 |
11 | 2751aa10 |
12 | 15599b40 |
13 | aa80116 |
14 | 6d10c00 |
15 | 48b4816 |
hex | 31ca820 |
52209696 has 144 divisors (see below), whose sum is σ = 174091680. Its totient is φ = 13547520.
The previous prime is 52209691. The next prime is 52209709. The reversal of 52209696 is 69690225.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (52209691) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 51240 + ... + 52248.
It is an arithmetic number, because the mean of its divisors is an integer number (1208970).
Almost surely, 252209696 is an apocalyptic number.
52209696 is a gapful number since it is divisible by the number (56) 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 52209696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87045840).
52209696 is an abundant number, since it is smaller than the sum of its proper divisors (121881984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52209696 is a wasteful number, since it uses less digits than its factorization.
52209696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1047 (or 1032 counting only the distinct ones).
The product of its (nonzero) digits is 58320, while the sum is 39.
The square root of 52209696 is about 7225.6277235961. The cubic root of 52209696 is about 373.7521688297.
The spelling of 52209696 in words is "fifty-two million, two hundred nine thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •