Base | Representation |
---|---|
bin | 110001011010011011… |
… | …001100001100000000 |
3 | 12001221121111211220000 |
4 | 301122123030030000 |
5 | 1332130002403200 |
6 | 40212432520000 |
7 | 3555536244150 |
oct | 613233141400 |
9 | 161847454800 |
10 | 53056684800 |
11 | 2055712a639 |
12 | a3486b0000 |
13 | 5007110262 |
14 | 27d4690760 |
15 | 15a7dd4300 |
hex | c5a6cc300 |
53056684800 has 540 divisors, whose sum is σ = 224215034736. Its totient is φ = 12126412800.
The previous prime is 53056684789. The next prime is 53056684819. The reversal of 53056684800 is 848665035.
53056684800 is a `hidden beast` number, since 5 + 3 + 0 + 566 + 8 + 4 + 80 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (540).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 3621490 + ... + 3636110.
Almost surely, 253056684800 is an apocalyptic number.
53056684800 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 53056684800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (112107517368).
53056684800 is an abundant number, since it is smaller than the sum of its proper divisors (171158349936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53056684800 is a wasteful number, since it uses less digits than its factorization.
53056684800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14666 (or 14638 counting only the distinct ones).
The product of its (nonzero) digits is 691200, while the sum is 45.
The spelling of 53056684800 in words is "fifty-three billion, fifty-six million, six hundred eighty-four thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •