Base | Representation |
---|---|
bin | 110001011000110101… |
… | …100110110110000100 |
3 | 12001212202101221002020 |
4 | 301120311212312010 |
5 | 1332101143232200 |
6 | 40210042043140 |
7 | 3555064014135 |
oct | 613065466604 |
9 | 161782357066 |
10 | 53030055300 |
11 | 205430a1492 |
12 | a33b7a94b0 |
13 | 5001748461 |
14 | 27d0d1bc8c |
15 | 15a58c3ea0 |
hex | c58d66d84 |
53030055300 has 144 divisors (see below), whose sum is σ = 157177648320. Its totient is φ = 13797020160.
The previous prime is 53030055263. The next prime is 53030055301. The reversal of 53030055300 is 355003035.
It is not an unprimeable number, because it can be changed into a prime (53030055301) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 15646006 + ... + 15649394.
Almost surely, 253030055300 is an apocalyptic number.
53030055300 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 53030055300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (78588824160).
53030055300 is an abundant number, since it is smaller than the sum of its proper divisors (104147593020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53030055300 is a wasteful number, since it uses less digits than its factorization.
53030055300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4662 (or 4655 counting only the distinct ones).
The product of its (nonzero) digits is 3375, while the sum is 24.
Adding to 53030055300 its reverse (355003035), we get a palindrome (53385058335).
The spelling of 53030055300 in words is "fifty-three billion, thirty million, fifty-five thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •