Base | Representation |
---|---|
bin | 110100101110110100… |
… | …111111000111010100 |
3 | 12102010221221000210020 |
4 | 310232310333013110 |
5 | 1411424233414123 |
6 | 42002211425140 |
7 | 4043046621222 |
oct | 645664770724 |
9 | 172127830706 |
10 | 56620216788 |
11 | 220156aa9a3 |
12 | ab81bb51b0 |
13 | 5454492375 |
14 | 2a51a69b12 |
15 | 1715b907e3 |
hex | d2ed3f1d4 |
56620216788 has 48 divisors (see below), whose sum is σ = 138081767040. Its totient is φ = 18023509504.
The previous prime is 56620216729. The next prime is 56620216789. The reversal of 56620216788 is 88761202665.
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 56620216788.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56620216789) 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, 4048 + ... + 336536.
It is an arithmetic number, because the mean of its divisors is an integer number (2876703480).
Almost surely, 256620216788 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 56620216788, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69040883520).
56620216788 is an abundant number, since it is smaller than the sum of its proper divisors (81461550252).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56620216788 is a wasteful number, since it uses less digits than its factorization.
56620216788 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333136 (or 333134 counting only the distinct ones).
The product of its (nonzero) digits is 1935360, while the sum is 51.
The spelling of 56620216788 in words is "fifty-six billion, six hundred twenty million, two hundred sixteen thousand, seven hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •