Base | Representation |
---|---|
bin | 11001100011011101101001… |
… | …00011011010010011000000 |
3 | 21100222002202111100012001112 |
4 | 30301232310203122103000 |
5 | 24331140442044041300 |
6 | 315303112403422452 |
7 | 14556613562405621 |
oct | 1461566443322300 |
9 | 240862674305045 |
10 | 56194086315200 |
11 | 169a5861825829 |
12 | 6376959984a28 |
13 | 2548105b67b62 |
14 | dc3b45d37a48 |
15 | 676b0ccd3e35 |
hex | 331bb48da4c0 |
56194086315200 has 336 divisors, whose sum is σ = 142793385593760. Its totient is φ = 21749748203520.
The previous prime is 56194086315173. The next prime is 56194086315209. The reversal of 56194086315200 is 251368049165.
It is a Harshad number since it is a multiple of its sum of digits (50).
It is not an unprimeable number, because it can be changed into a prime (56194086315209) 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, 9461873831 + ... + 9461879769.
Almost surely, 256194086315200 is an apocalyptic number.
56194086315200 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 56194086315200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71396692796880).
56194086315200 is an abundant number, since it is smaller than the sum of its proper divisors (86599299278560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56194086315200 is a wasteful number, since it uses less digits than its factorization.
56194086315200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6852 (or 6837 counting only the distinct ones).
The product of its (nonzero) digits is 1555200, while the sum is 50.
The spelling of 56194086315200 in words is "fifty-six trillion, one hundred ninety-four billion, eighty-six million, three hundred fifteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •