Base | Representation |
---|---|
bin | 10000001100110110011… |
… | …10101110110111101101 |
3 | 1222012211020210120210110 |
4 | 20012123032232313231 |
5 | 33110012202033121 |
6 | 1103420202530233 |
7 | 55134301244115 |
oct | 10063316566755 |
9 | 1865736716713 |
10 | 556655111661 |
11 | 1a5092331430 |
12 | 8ba72806979 |
13 | 4065290a09c |
14 | 1cd29774045 |
15 | e72e8b7d76 |
hex | 819b3aeded |
556655111661 has 16 divisors (see below), whose sum is σ = 857308408128. Its totient is φ = 317521632000.
The previous prime is 556655111653. The next prime is 556655111767. The reversal of 556655111661 is 166111556655.
It is not a de Polignac number, because 556655111661 - 23 = 556655111653 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 556655111661.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (556655111641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 496126990 + ... + 496128111.
It is an arithmetic number, because the mean of its divisors is an integer number (53581775508).
Almost surely, 2556655111661 is an apocalyptic number.
556655111661 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
556655111661 is a deficient number, since it is larger than the sum of its proper divisors (300653296467).
556655111661 is a wasteful number, since it uses less digits than its factorization.
556655111661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 992255132.
The product of its digits is 810000, while the sum is 48.
The spelling of 556655111661 in words is "five hundred fifty-six billion, six hundred fifty-five million, one hundred eleven thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •