Base | Representation |
---|---|
bin | 110100010011110010… |
… | …110111110011000100 |
3 | 12100222100111212010020 |
4 | 310103302313303010 |
5 | 1410012132141300 |
6 | 41445210455140 |
7 | 4025601611640 |
oct | 642362676304 |
9 | 170870455106 |
10 | 56166677700 |
11 | 21902697301 |
12 | aa761344b0 |
13 | 53b1526843 |
14 | 2a0b729c20 |
15 | 16dae538a0 |
hex | d13cb7cc4 |
56166677700 has 144 divisors (see below), whose sum is σ = 185817523584. Its totient is φ = 12831667200.
The previous prime is 56166677663. The next prime is 56166677711. The reversal of 56166677700 is 777666165.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5120622 + ... + 5131578.
Almost surely, 256166677700 is an apocalyptic number.
56166677700 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 56166677700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (92908761792).
56166677700 is an abundant number, since it is smaller than the sum of its proper divisors (129650845884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56166677700 is a wasteful number, since it uses less digits than its factorization.
56166677700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13422 (or 13415 counting only the distinct ones).
The product of its (nonzero) digits is 2222640, while the sum is 51.
It can be divided in two parts, 56166 and 677700, that added together give a triangular number (733866 = T1211).
The spelling of 56166677700 in words is "fifty-six billion, one hundred sixty-six million, six hundred seventy-seven thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •