Base | Representation |
---|---|
bin | 10000001011111100000… |
… | …00101011100110001100 |
3 | 1222011120002100200200120 |
4 | 20011332000223212030 |
5 | 33103011202421342 |
6 | 1103255411424540 |
7 | 55116166361340 |
oct | 10057600534614 |
9 | 1864502320616 |
10 | 556164888972 |
11 | 1a4960642910 |
12 | 8b9565b5150 |
13 | 405a51993a4 |
14 | 1ccc0605620 |
15 | e701831aec |
hex | 817e02b98c |
556164888972 has 192 divisors, whose sum is σ = 1659137679360. Its totient is φ = 140786956800.
The previous prime is 556164888913. The next prime is 556164888989. The reversal of 556164888972 is 279888461655.
It is a junction number, because it is equal to n+sod(n) for n = 556164888897 and 556164888906.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 38596593 + ... + 38610999.
It is an arithmetic number, because the mean of its divisors is an integer number (8641342080).
Almost surely, 2556164888972 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 556164888972, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (829568839680).
556164888972 is an abundant number, since it is smaller than the sum of its proper divisors (1102972790388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
556164888972 is a wasteful number, since it uses less digits than its factorization.
556164888972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15492 (or 15490 counting only the distinct ones).
The product of its digits is 232243200, while the sum is 69.
The spelling of 556164888972 in words is "five hundred fifty-six billion, one hundred sixty-four million, eight hundred eighty-eight thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •