Base | Representation |
---|---|
bin | 100001001001011… |
… | …010101001111101 |
3 | 1102202102122120022 |
4 | 201021122221331 |
5 | 2114331212410 |
6 | 131103301525 |
7 | 16531625132 |
oct | 4111325175 |
9 | 1382378508 |
10 | 556116605 |
11 | 265a05700 |
12 | 1362aa8a5 |
13 | 8b2a25a5 |
14 | 53c02589 |
15 | 33c50455 |
hex | 2125aa7d |
556116605 has 48 divisors (see below), whose sum is σ = 781401600. Its totient is φ = 378576000.
The previous prime is 556116601. The next prime is 556116607. The reversal of 556116605 is 506611655.
556116605 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 556116605 - 22 = 556116601 is a prime.
It is a super-3 number, since 3×5561166053 (a number of 27 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (556116601) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1160756 + ... + 1161234.
It is an arithmetic number, because the mean of its divisors is an integer number (16279200).
Almost surely, 2556116605 is an apocalyptic number.
556116605 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
556116605 is a deficient number, since it is larger than the sum of its proper divisors (225284995).
556116605 is a wasteful number, since it uses less digits than its factorization.
556116605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 626 (or 615 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 35.
The square root of 556116605 is about 23582.1246922325. The cubic root of 556116605 is about 822.3473317219.
The spelling of 556116605 in words is "five hundred fifty-six million, one hundred sixteen thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •