Base | Representation |
---|---|
bin | 110001001110111010… |
… | …0111010001001000001 |
3 | 101002220022012112222211 |
4 | 1202131310322021001 |
5 | 3213012114421044 |
6 | 120323110502121 |
7 | 10432005405232 |
oct | 1423564721101 |
9 | 332808175884 |
10 | 105727107649 |
11 | 40925217919 |
12 | 185a7964941 |
13 | 9c7c1ac037 |
14 | 518d915089 |
15 | 2b3be1a634 |
hex | 189dd3a241 |
105727107649 has 2 divisors, whose sum is σ = 105727107650. Its totient is φ = 105727107648.
The previous prime is 105727107631. The next prime is 105727107667. The reversal of 105727107649 is 946701727501.
It is a balanced prime because it is at equal distance from previous prime (105727107631) and next prime (105727107667).
It can be written as a sum of positive squares in only one way, i.e., 86939471025 + 18787636624 = 294855^2 + 137068^2 .
It is a cyclic number.
It is not a de Polignac number, because 105727107649 - 25 = 105727107617 is a prime.
It is a super-2 number, since 2×1057271076492 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105727807649) 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, 52863553824 + 52863553825.
It is an arithmetic number, because the mean of its divisors is an integer number (52863553825).
Almost surely, 2105727107649 is an apocalyptic number.
It is an amenable number.
105727107649 is a deficient number, since it is larger than the sum of its proper divisors (1).
105727107649 is an equidigital number, since it uses as much as digits as its factorization.
105727107649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 740880, while the sum is 49.
The spelling of 105727107649 in words is "one hundred five billion, seven hundred twenty-seven million, one hundred seven thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •