Base | Representation |
---|---|
bin | 10000001011110101000… |
… | …10011000100100111101 |
3 | 1222011102000201001222001 |
4 | 20011322202120210331 |
5 | 33102401243140401 |
6 | 1103245530422301 |
7 | 55114561143562 |
oct | 10057242304475 |
9 | 1864360631861 |
10 | 556106615101 |
11 | 1a4930760894 |
12 | 8b93ab91991 |
13 | 405960a4ccb |
14 | 1ccb6996869 |
15 | e6eb670601 |
hex | 817a89893d |
556106615101 has 8 divisors (see below), whose sum is σ = 567839301624. Its totient is φ = 544485139200.
The previous prime is 556106615023. The next prime is 556106615117. The reversal of 556106615101 is 101516601655.
It can be written as a sum of positive squares in 4 ways, for example, as 115854459876 + 440252155225 = 340374^2 + 663515^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 556106615101 - 221 = 556104517949 is a prime.
It is a super-2 number, since 2×5561066151012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (556106615171) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27792550 + ... + 27812551.
It is an arithmetic number, because the mean of its divisors is an integer number (70979912703).
Almost surely, 2556106615101 is an apocalyptic number.
It is an amenable number.
556106615101 is a deficient number, since it is larger than the sum of its proper divisors (11732686523).
556106615101 is a wasteful number, since it uses less digits than its factorization.
556106615101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55605311.
The product of its (nonzero) digits is 27000, while the sum is 37.
The spelling of 556106615101 in words is "five hundred fifty-six billion, one hundred six million, six hundred fifteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •