Base | Representation |
---|---|
bin | 110101000000001011… |
… | …111100010011110000 |
3 | 12102220020221001220202 |
4 | 311000023330103300 |
5 | 1413023312303110 |
6 | 42051133454332 |
7 | 4053214214552 |
oct | 650013742360 |
9 | 172806831822 |
10 | 56911447280 |
11 | 22155034756 |
12 | b0436413a8 |
13 | 549c90c6bc |
14 | 2a7c5d94d2 |
15 | 173151b0a5 |
hex | d402fc4f0 |
56911447280 has 80 divisors (see below), whose sum is σ = 137456077248. Its totient is φ = 21896448000.
The previous prime is 56911447277. The next prime is 56911447283. The reversal of 56911447280 is 8274411965.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (56911447277) and next prime (56911447283).
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56911447283) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 110690 + ... + 355070.
Almost surely, 256911447280 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56911447280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (68728038624).
56911447280 is an abundant number, since it is smaller than the sum of its proper divisors (80544629968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56911447280 is a wasteful number, since it uses less digits than its factorization.
56911447280 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 244506 (or 244500 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 47.
The spelling of 56911447280 in words is "fifty-six billion, nine hundred eleven million, four hundred forty-seven thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •