Base | Representation |
---|---|
bin | 110001010101111001… |
… | …0010100110100010001 |
3 | 101010111121220100021201 |
4 | 1202223302110310101 |
5 | 3214002043432010 |
6 | 120402234351201 |
7 | 10440551200300 |
oct | 1425362246421 |
9 | 333447810251 |
10 | 105961311505 |
11 | 40a35441725 |
12 | 1865228b501 |
13 | 9cb88808ba |
14 | 51b2a7c437 |
15 | 2b5277e23a |
hex | 18abc94d11 |
105961311505 has 12 divisors (see below), whose sum is σ = 147913341300. Its totient is φ = 72659184864.
The previous prime is 105961311499. The next prime is 105961311509. The reversal of 105961311505 is 505113169501.
It can be written as a sum of positive squares in 2 ways, for example, as 14307987456 + 91653324049 = 119616^2 + 302743^2 .
It is not a de Polignac number, because 105961311505 - 23 = 105961311497 is a prime.
It is a super-2 number, since 2×1059613115052 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105961311509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 216247330 + ... + 216247819.
It is an arithmetic number, because the mean of its divisors is an integer number (12326111775).
Almost surely, 2105961311505 is an apocalyptic number.
It is an amenable number.
105961311505 is a deficient number, since it is larger than the sum of its proper divisors (41952029795).
105961311505 is an equidigital number, since it uses as much as digits as its factorization.
105961311505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 432495168 (or 432495161 counting only the distinct ones).
The product of its (nonzero) digits is 20250, while the sum is 37.
The spelling of 105961311505 in words is "one hundred five billion, nine hundred sixty-one million, three hundred eleven thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •