Base | Representation |
---|---|
bin | 10000001011101001100… |
… | …10001101010101011101 |
3 | 1222011011022002121012221 |
4 | 20011310302031111131 |
5 | 33102202041200221 |
6 | 1103232202025341 |
7 | 55112306604613 |
oct | 10056462152535 |
9 | 1864138077187 |
10 | 556010100061 |
11 | 1a489122a699 |
12 | 8b9127a8251 |
13 | 4057c0b1810 |
14 | 1cca7c316b3 |
15 | e6e2e58541 |
hex | 8174c8d55d |
556010100061 has 4 divisors (see below), whose sum is σ = 598780107772. Its totient is φ = 513240092352.
The previous prime is 556010100047. The next prime is 556010100131. The reversal of 556010100061 is 160001010655.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 136389876100 + 419620223961 = 369310^2 + 647781^2 .
It is not a de Polignac number, because 556010100061 - 211 = 556010098013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 556010099999 and 556010100035.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (556010100011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21385003836 + ... + 21385003861.
It is an arithmetic number, because the mean of its divisors is an integer number (149695026943).
Almost surely, 2556010100061 is an apocalyptic number.
It is an amenable number.
556010100061 is a deficient number, since it is larger than the sum of its proper divisors (42770007711).
556010100061 is a wasteful number, since it uses less digits than its factorization.
556010100061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42770007710.
The product of its (nonzero) digits is 900, while the sum is 25.
The spelling of 556010100061 in words is "five hundred fifty-six billion, ten million, one hundred thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •