Base | Representation |
---|---|
bin | 1100100010110… |
… | …1000010110100 |
3 | 10200000000212202 |
4 | 3020231002310 |
5 | 101432111200 |
6 | 5115404032 |
7 | 1206130355 |
oct | 310550264 |
9 | 120000782 |
10 | 52613300 |
11 | 27776173 |
12 | 15753618 |
13 | ab91a3c |
14 | 6db7d2c |
15 | 49441d5 |
hex | 322d0b4 |
52613300 has 36 divisors (see below), whose sum is σ = 120890700. Its totient is φ = 19806720.
The previous prime is 52613287. The next prime is 52613333. The reversal of 52613300 is 331625.
It can be written as a sum of positive squares in 6 ways, for example, as 4477456 + 48135844 = 2116^2 + 6938^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 13775 + ... + 17174.
It is an arithmetic number, because the mean of its divisors is an integer number (3358075).
Almost surely, 252613300 is an apocalyptic number.
52613300 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
52613300 is an abundant number, since it is smaller than the sum of its proper divisors (68277400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52613300 is a wasteful number, since it uses less digits than its factorization.
52613300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30980 (or 30973 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 20.
The square root of 52613300 is about 7253.5026021916. The cubic root of 52613300 is about 374.7127874875.
Adding to 52613300 its reverse (331625), we get a palindrome (52944925).
The spelling of 52613300 in words is "fifty-two million, six hundred thirteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •