Base | Representation |
---|---|
bin | 110001001001111110… |
… | …1001100010010001111 |
3 | 101002110202121011112221 |
4 | 1202103331030102033 |
5 | 3212142221210314 |
6 | 120254433240211 |
7 | 10424625001336 |
oct | 1422375142217 |
9 | 332422534487 |
10 | 105561506959 |
11 | 4084a79a647 |
12 | 18560403067 |
13 | 9c53aaa26c |
14 | 5175928d1d |
15 | 2b2c608824 |
hex | 1893f4c48f |
105561506959 has 2 divisors, whose sum is σ = 105561506960. Its totient is φ = 105561506958.
The previous prime is 105561506887. The next prime is 105561506983. The reversal of 105561506959 is 959605165501.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 105561506959 - 219 = 105560982671 is a prime.
It is a super-2 number, since 2×1055615069592 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105561506989) 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 as a sum of consecutive naturals, namely, 52780753479 + 52780753480.
It is an arithmetic number, because the mean of its divisors is an integer number (52780753480).
Almost surely, 2105561506959 is an apocalyptic number.
105561506959 is a deficient number, since it is larger than the sum of its proper divisors (1).
105561506959 is an equidigital number, since it uses as much as digits as its factorization.
105561506959 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1822500, while the sum is 52.
The spelling of 105561506959 in words is "one hundred five billion, five hundred sixty-one million, five hundred six thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.161 sec. • engine limits •