Base | Representation |
---|---|
bin | 10000010101001001100… |
… | …10111001110110011101 |
3 | 1222122022202111121111201 |
4 | 20022210302321312131 |
5 | 33143123300243221 |
6 | 1105434242315501 |
7 | 55352562013666 |
oct | 10124462716635 |
9 | 1878282447451 |
10 | 561110556061 |
11 | 1a6a6930a790 |
12 | 908b6958b91 |
13 | 40bb29b3613 |
14 | 1d22d3a236d |
15 | e8e0b04891 |
hex | 82a4cb9d9d |
561110556061 has 16 divisors (see below), whose sum is σ = 612867138048. Its totient is φ = 509478807600.
The previous prime is 561110556023. The next prime is 561110556077. The reversal of 561110556061 is 160655011165.
561110556061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 561110556061 - 225 = 561077001629 is a prime.
It is a super-2 number, since 2×5611105560612 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 561110556061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (561110553061) 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, 32760846 + ... + 32777968.
It is an arithmetic number, because the mean of its divisors is an integer number (38304196128).
Almost surely, 2561110556061 is an apocalyptic number.
It is an amenable number.
561110556061 is a deficient number, since it is larger than the sum of its proper divisors (51756581987).
561110556061 is a wasteful number, since it uses less digits than its factorization.
561110556061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20592.
The product of its (nonzero) digits is 27000, while the sum is 37.
The spelling of 561110556061 in words is "five hundred sixty-one billion, one hundred ten million, five hundred fifty-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •