Base | Representation |
---|---|
bin | 110000111001010000… |
… | …1010101010000101001 |
3 | 101001000200001212220020 |
4 | 1201302201111100221 |
5 | 3210020120234221 |
6 | 120123034151053 |
7 | 10405003665456 |
oct | 1416241252051 |
9 | 331020055806 |
10 | 105000555561 |
11 | 40592092550 |
12 | 18424582489 |
13 | 9b94804165 |
14 | 512122882d |
15 | 2ae8250ac6 |
hex | 1872855429 |
105000555561 has 64 divisors (see below), whose sum is σ = 159073272576. Its totient is φ = 61046784000.
The previous prime is 105000555533. The next prime is 105000555571. The reversal of 105000555561 is 165555000501.
It is not a de Polignac number, because 105000555561 - 25 = 105000555529 is a prime.
It is a super-2 number, since 2×1050005555612 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (105000555571) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 31691841 + ... + 31695153.
It is an arithmetic number, because the mean of its divisors is an integer number (2485519884).
Almost surely, 2105000555561 is an apocalyptic number.
105000555561 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
105000555561 is a deficient number, since it is larger than the sum of its proper divisors (54072717015).
105000555561 is a wasteful number, since it uses less digits than its factorization.
105000555561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3722.
The product of its (nonzero) digits is 18750, while the sum is 33.
The spelling of 105000555561 in words is "one hundred five billion, five hundred fifty-five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •