Base | Representation |
---|---|
bin | 110000111010000010… |
… | …100011000111011000 |
3 | 12000112202010210102110 |
4 | 300322002203013120 |
5 | 1330021404313300 |
6 | 40042503232320 |
7 | 3536221101006 |
oct | 607202430730 |
9 | 160482123373 |
10 | 52513354200 |
11 | 202a846828a |
12 | a2167486a0 |
13 | 4c4b696668 |
14 | 2782459a76 |
15 | 157535c550 |
hex | c3a0a31d8 |
52513354200 has 192 divisors, whose sum is σ = 165386512800. Its totient is φ = 13782016000.
The previous prime is 52513354123. The next prime is 52513354207. The reversal of 52513354200 is 245331525.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52513354207) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10481296 + ... + 10486304.
Almost surely, 252513354200 is an apocalyptic number.
52513354200 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 52513354200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82693256400).
52513354200 is an abundant number, since it is smaller than the sum of its proper divisors (112873158600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52513354200 is a wasteful number, since it uses less digits than its factorization.
52513354200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5302 (or 5293 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 30.
Adding to 52513354200 its reverse (245331525), we get a palindrome (52758685725).
The spelling of 52513354200 in words is "fifty-two billion, five hundred thirteen million, three hundred fifty-four thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •