Base | Representation |
---|---|
bin | 110001001001101010… |
… | …0110000000110010101 |
3 | 101002110000122120102112 |
4 | 1202103110300012111 |
5 | 3212132012440444 |
6 | 120253414120405 |
7 | 10424435616122 |
oct | 1422324600625 |
9 | 332400576375 |
10 | 105550905749 |
11 | 40844809813 |
12 | 18558950105 |
13 | 9c51837b63 |
14 | 5174369749 |
15 | 2b2b71269e |
hex | 1893530195 |
105550905749 has 2 divisors, whose sum is σ = 105550905750. Its totient is φ = 105550905748.
The previous prime is 105550905739. The next prime is 105550905781. The reversal of 105550905749 is 947509055501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 105254824900 + 296080849 = 324430^2 + 17207^2 .
It is an emirp because it is prime and its reverse (947509055501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 105550905749 - 212 = 105550901653 is a prime.
It is a super-2 number, since 2×1055509057492 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105550905697 and 105550905706.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105550905739) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52775452874 + 52775452875.
It is an arithmetic number, because the mean of its divisors is an integer number (52775452875).
Almost surely, 2105550905749 is an apocalyptic number.
It is an amenable number.
105550905749 is a deficient number, since it is larger than the sum of its proper divisors (1).
105550905749 is an equidigital number, since it uses as much as digits as its factorization.
105550905749 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1417500, while the sum is 50.
The spelling of 105550905749 in words is "one hundred five billion, five hundred fifty million, nine hundred five thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •