Base | Representation |
---|---|
bin | 110001101010000111… |
… | …101011011001010000 |
3 | 12002121221222220120102 |
4 | 301222013223121100 |
5 | 1333144410131300 |
6 | 40254520431532 |
7 | 3565214365130 |
oct | 615207533120 |
9 | 162557886512 |
10 | 53320005200 |
11 | 20681831100 |
12 | a4009185a8 |
13 | 5049837947 |
14 | 281b636ac0 |
15 | 15c109a0d5 |
hex | c6a1eb650 |
53320005200 has 360 divisors, whose sum is σ = 161743772736. Its totient is φ = 16534425600.
The previous prime is 53320005173. The next prime is 53320005223. The reversal of 53320005200 is 250002335.
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 (17) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 114175367 + ... + 114175833.
Almost surely, 253320005200 is an apocalyptic number.
53320005200 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 53320005200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (80871886368).
53320005200 is an abundant number, since it is smaller than the sum of its proper divisors (108423767536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53320005200 is a wasteful number, since it uses less digits than its factorization.
53320005200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 851 (or 829 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 20.
Adding to 53320005200 its reverse (250002335), we get a palindrome (53570007535).
The spelling of 53320005200 in words is "fifty-three billion, three hundred twenty million, five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •