Base | Representation |
---|---|
bin | 110100001100011011… |
… | …110010110000000000 |
3 | 12100122202010220000000 |
4 | 310030123302300000 |
5 | 1404234023442300 |
6 | 41425040000000 |
7 | 4022542142220 |
oct | 641433626000 |
9 | 170582126000 |
10 | 56043187200 |
11 | 21849a11040 |
12 | aa40900000 |
13 | 5391a79c40 |
14 | 29d9182080 |
15 | 16d01adc00 |
hex | d0c6f2c00 |
56043187200 has 2112 divisors, whose sum is σ = 279738762240. Its totient is φ = 10749542400.
The previous prime is 56043187147. The next prime is 56043187201. The reversal of 56043187200 is 278134065.
It is a tau number, because it is divible by the number of its divisors (2112).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56043187201) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 4311014394 + ... + 4311014406.
Almost surely, 256043187200 is an apocalyptic number.
56043187200 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 56043187200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (139869381120).
56043187200 is an abundant number, since it is smaller than the sum of its proper divisors (223695575040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56043187200 is a wasteful number, since it uses less digits than its factorization.
56043187200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82 (or 41 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 36.
The spelling of 56043187200 in words is "fifty-six billion, forty-three million, one hundred eighty-seven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •