Base | Representation |
---|---|
bin | 10000010101001000010… |
… | …11000011100100011001 |
3 | 1222122022000211220100110 |
4 | 20022210023003210121 |
5 | 33143113112010410 |
6 | 1105433230354533 |
7 | 55352404146213 |
oct | 10124413034431 |
9 | 1878260756313 |
10 | 561100110105 |
11 | 1a6a63425567 |
12 | 908b335ba49 |
13 | 40bb0796a92 |
14 | 1d22bc435b3 |
15 | e8dec3e720 |
hex | 82a42c3919 |
561100110105 has 32 divisors (see below), whose sum is σ = 918451137024. Its totient is φ = 292378484736.
The previous prime is 561100110101. The next prime is 561100110203. The reversal of 561100110105 is 501011001165.
It is a happy number.
It is not a de Polignac number, because 561100110105 - 22 = 561100110101 is a prime.
It is a super-2 number, since 2×5611001101052 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (561100110101) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 282892 + ... + 1096461.
It is an arithmetic number, because the mean of its divisors is an integer number (28701598032).
Almost surely, 2561100110105 is an apocalyptic number.
It is an amenable number.
561100110105 is a deficient number, since it is larger than the sum of its proper divisors (357351026919).
561100110105 is a wasteful number, since it uses less digits than its factorization.
561100110105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1379985.
The product of its (nonzero) digits is 150, while the sum is 21.
The spelling of 561100110105 in words is "five hundred sixty-one billion, one hundred million, one hundred ten thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •