Base | Representation |
---|---|
bin | 110000111100101110… |
… | …1111100001000101001 |
3 | 101001022210101022001011 |
4 | 1201321131330020221 |
5 | 3210234434403404 |
6 | 120142400223521 |
7 | 10410620444005 |
oct | 1417135741051 |
9 | 331283338034 |
10 | 105117106729 |
11 | 40641959128 |
12 | 1845760aba1 |
13 | 9bb29c134b |
14 | 51328c7705 |
15 | 2b035c4604 |
hex | 187977c229 |
105117106729 has 2 divisors, whose sum is σ = 105117106730. Its totient is φ = 105117106728.
The previous prime is 105117106669. The next prime is 105117106753. The reversal of 105117106729 is 927601711501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104869107225 + 247999504 = 323835^2 + 15748^2 .
It is a cyclic number.
It is not a de Polignac number, because 105117106729 - 225 = 105083552297 is a prime.
It is a super-2 number, since 2×1051171067292 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105117106691 and 105117106700.
It is not a weakly prime, because it can be changed into another prime (105117101729) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52558553364 + 52558553365.
It is an arithmetic number, because the mean of its divisors is an integer number (52558553365).
Almost surely, 2105117106729 is an apocalyptic number.
It is an amenable number.
105117106729 is a deficient number, since it is larger than the sum of its proper divisors (1).
105117106729 is an equidigital number, since it uses as much as digits as its factorization.
105117106729 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26460, while the sum is 40.
The spelling of 105117106729 in words is "one hundred five billion, one hundred seventeen million, one hundred six thousand, seven hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •