Base | Representation |
---|---|
bin | 110010111011111111… |
… | …001111100110001100 |
3 | 12020011200111222202110 |
4 | 302323333033212030 |
5 | 1344003020312100 |
6 | 41043104024020 |
7 | 3644233204506 |
oct | 627377174614 |
9 | 166150458673 |
10 | 54693525900 |
11 | 21217084582 |
12 | a724902010 |
13 | 5208274aa0 |
14 | 290bc14d76 |
15 | 165195e250 |
hex | cbbfcf98c |
54693525900 has 144 divisors (see below), whose sum is σ = 170525759264. Its totient is φ = 13454622720.
The previous prime is 54693525889. The next prime is 54693525923. The reversal of 54693525900 is 952539645.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 54693525900.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 8237382 + ... + 8244018.
Almost surely, 254693525900 is an apocalyptic number.
54693525900 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 54693525900, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85262879632).
54693525900 is an abundant number, since it is smaller than the sum of its proper divisors (115832233364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54693525900 is a wasteful number, since it uses less digits than its factorization.
54693525900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8780 (or 8773 counting only the distinct ones).
The product of its (nonzero) digits is 1458000, while the sum is 48.
The spelling of 54693525900 in words is "fifty-four billion, six hundred ninety-three million, five hundred twenty-five thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •