Base | Representation |
---|---|
bin | 110010100010111001… |
… | …111111000000000000 |
3 | 12012002100200200012020 |
4 | 302202321333000000 |
5 | 1342122303414200 |
6 | 40533232401440 |
7 | 3630633324021 |
oct | 624271770000 |
9 | 165070620166 |
10 | 54272716800 |
11 | 21020596465 |
12 | a6279a6280 |
13 | 516c028a13 |
14 | 28abd94c48 |
15 | 1629a39ea0 |
hex | ca2e7f000 |
54272716800 has 624 divisors, whose sum is σ = 191111101440. Its totient is φ = 13565952000.
The previous prime is 54272716793. The next prime is 54272716807. The reversal of 54272716800 is 861727245.
It is an interprime number because it is at equal distance from previous prime (54272716793) and next prime (54272716807).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54272716807) 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, 390451131 + ... + 390451269.
Almost surely, 254272716800 is an apocalyptic number.
54272716800 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 54272716800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (95555550720).
54272716800 is an abundant number, since it is smaller than the sum of its proper divisors (136838384640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54272716800 is a wasteful number, since it uses less digits than its factorization.
54272716800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248 (or 221 counting only the distinct ones).
The product of its (nonzero) digits is 188160, while the sum is 42.
The spelling of 54272716800 in words is "fifty-four billion, two hundred seventy-two million, seven hundred sixteen thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •