Base | Representation |
---|---|
bin | 110010110000011110… |
… | …101010000100011000 |
3 | 12012200020011220202000 |
4 | 302300132222010120 |
5 | 1343104102343300 |
6 | 41012005241000 |
7 | 3636400022112 |
oct | 626036520430 |
9 | 165606156660 |
10 | 54500434200 |
11 | 2112808a963 |
12 | a690103160 |
13 | 51a7269044 |
14 | 28d03103b2 |
15 | 163ea1bc00 |
hex | cb07aa118 |
54500434200 has 192 divisors, whose sum is σ = 188139520800. Its totient is φ = 14501260800.
The previous prime is 54500434169. The next prime is 54500434279. The reversal of 54500434200 is 243400545.
54500434200 is a `hidden beast` number, since 5 + 450 + 0 + 4 + 3 + 4 + 200 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2478454 + ... + 2500346.
Almost surely, 254500434200 is an apocalyptic number.
54500434200 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 54500434200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (94069760400).
54500434200 is an abundant number, since it is smaller than the sum of its proper divisors (133639086600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54500434200 is a wasteful number, since it uses less digits than its factorization.
54500434200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22379 (or 22364 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 27.
Adding to 54500434200 its reverse (243400545), we get a palindrome (54743834745).
The spelling of 54500434200 in words is "fifty-four billion, five hundred million, four hundred thirty-four thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •