Base | Representation |
---|---|
bin | 110001001100101010… |
… | …0101110001001011001 |
3 | 101002201001001101112121 |
4 | 1202121110232021121 |
5 | 3212333244423144 |
6 | 120311411341241 |
7 | 10430100310606 |
oct | 1423124561131 |
9 | 332631041477 |
10 | 105651561049 |
11 | 40896608611 |
12 | 185865b1821 |
13 | 9c6964a9c8 |
14 | 518388b6ad |
15 | 2b35496384 |
hex | 189952e259 |
105651561049 has 2 divisors, whose sum is σ = 105651561050. Its totient is φ = 105651561048.
The previous prime is 105651561023. The next prime is 105651561061. The reversal of 105651561049 is 940165156501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 86970138649 + 18681422400 = 294907^2 + 136680^2 .
It is a cyclic number.
It is not a de Polignac number, because 105651561049 - 219 = 105651036761 is a prime.
It is a super-2 number, since 2×1056515610492 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105651560996 and 105651561014.
It is not a weakly prime, because it can be changed into another prime (105681561049) 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 as a sum of consecutive naturals, namely, 52825780524 + 52825780525.
It is an arithmetic number, because the mean of its divisors is an integer number (52825780525).
Almost surely, 2105651561049 is an apocalyptic number.
It is an amenable number.
105651561049 is a deficient number, since it is larger than the sum of its proper divisors (1).
105651561049 is an equidigital number, since it uses as much as digits as its factorization.
105651561049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162000, while the sum is 43.
The spelling of 105651561049 in words is "one hundred five billion, six hundred fifty-one million, five hundred sixty-one thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •