Base | Representation |
---|---|
bin | 110010000001101100… |
… | …000010010010000100 |
3 | 12010122112000122212102 |
4 | 302001230002102010 |
5 | 1340002121141400 |
6 | 40402043411232 |
7 | 3611055320000 |
oct | 620154022204 |
9 | 163575018772 |
10 | 53715412100 |
11 | 20864a4a169 |
12 | a4b1223b18 |
13 | 50b072b71c |
14 | 2857d63700 |
15 | 15e5b529d5 |
hex | c81b02484 |
53715412100 has 360 divisors, whose sum is σ = 144942473088. Its totient is φ = 17241100800.
The previous prime is 53715412061. The next prime is 53715412109. The reversal of 53715412100 is 121451735.
It is not an unprimeable number, because it can be changed into a prime (53715412109) 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 119 ways as a sum of consecutive naturals, for example, 392083232 + ... + 392083368.
Almost surely, 253715412100 is an apocalyptic number.
53715412100 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 53715412100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72471236544).
53715412100 is an abundant number, since it is smaller than the sum of its proper divisors (91227060988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53715412100 is a wasteful number, since it uses less digits than its factorization.
53715412100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273 (or 245 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 29.
Adding to 53715412100 its reverse (121451735), we get a palindrome (53836863835).
The spelling of 53715412100 in words is "fifty-three billion, seven hundred fifteen million, four hundred twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •