Base | Representation |
---|---|
bin | 1100011011001… |
… | …1110100000000 |
3 | 10122001210201111 |
4 | 3012303310000 |
5 | 101320213421 |
6 | 5101013104 |
7 | 1201661560 |
oct | 306636400 |
9 | 118053644 |
10 | 52116736 |
11 | 27467091 |
12 | 15554194 |
13 | aa49a09 |
14 | 6cc8da0 |
15 | 4896ee1 |
hex | 31b3d00 |
52116736 has 72 divisors (see below), whose sum is σ = 120350720. Its totient is φ = 22063104.
The previous prime is 52116721. The next prime is 52116739. The reversal of 52116736 is 63761125.
It is a junction number, because it is equal to n+sod(n) for n = 52116698 and 52116707.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52116739) 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 7 ways as a sum of consecutive naturals, for example, 227470 + ... + 227698.
Almost surely, 252116736 is an apocalyptic number.
52116736 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 52116736, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60175360).
52116736 is an abundant number, since it is smaller than the sum of its proper divisors (68233984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52116736 is a wasteful number, since it uses less digits than its factorization.
52116736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 379 (or 365 counting only the distinct ones).
The product of its digits is 7560, while the sum is 31.
The square root of 52116736 is about 7219.1921985773. The cubic root of 52116736 is about 373.5302136157.
The spelling of 52116736 in words is "fifty-two million, one hundred sixteen thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •