Base | Representation |
---|---|
bin | 110001001100110100… |
… | …0001000010010010001 |
3 | 101002201101121212200122 |
4 | 1202121220020102101 |
5 | 3212341100230344 |
6 | 120312112400025 |
7 | 10430161461053 |
oct | 1423150102221 |
9 | 332641555618 |
10 | 105656648849 |
11 | 40899473104 |
12 | 18588246015 |
13 | 9c6a70c73b |
14 | 51844138d3 |
15 | 2b35b4daee |
hex | 1899a08491 |
105656648849 has 2 divisors, whose sum is σ = 105656648850. Its totient is φ = 105656648848.
The previous prime is 105656648819. The next prime is 105656648857. The reversal of 105656648849 is 948846656501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 87501781249 + 18154867600 = 295807^2 + 134740^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105656648849 is a prime.
It is a super-2 number, since 2×1056566488492 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105656648791 and 105656648800.
It is not a weakly prime, because it can be changed into another prime (105656648809) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52828324424 + 52828324425.
It is an arithmetic number, because the mean of its divisors is an integer number (52828324425).
Almost surely, 2105656648849 is an apocalyptic number.
It is an amenable number.
105656648849 is a deficient number, since it is larger than the sum of its proper divisors (1).
105656648849 is an equidigital number, since it uses as much as digits as its factorization.
105656648849 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 49766400, while the sum is 62.
The spelling of 105656648849 in words is "one hundred five billion, six hundred fifty-six million, six hundred forty-eight thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •