Base | Representation |
---|---|
bin | 1100100001111… |
… | …11011000100001 |
3 | 21022210111201021 |
4 | 12100333120201 |
5 | 203402222332 |
6 | 14233005441 |
7 | 2414324122 |
oct | 620773041 |
9 | 238714637 |
10 | 105117217 |
11 | 54377137 |
12 | 2b253881 |
13 | 18a15a4a |
14 | dd64049 |
15 | 9365c97 |
hex | 643f621 |
105117217 has 2 divisors, whose sum is σ = 105117218. Its totient is φ = 105117216.
The previous prime is 105117209. The next prime is 105117269. The reversal of 105117217 is 712711501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 89189136 + 15928081 = 9444^2 + 3991^2 .
It is a cyclic number.
It is not a de Polignac number, because 105117217 - 23 = 105117209 is a prime.
It is a super-2 number, since 2×1051172172 = 22099258619650178, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105117191 and 105117200.
It is not a weakly prime, because it can be changed into another prime (105117917) 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, 52558608 + 52558609.
It is an arithmetic number, because the mean of its divisors is an integer number (52558609).
Almost surely, 2105117217 is an apocalyptic number.
It is an amenable number.
105117217 is a deficient number, since it is larger than the sum of its proper divisors (1).
105117217 is an equidigital number, since it uses as much as digits as its factorization.
105117217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 490, while the sum is 25.
The square root of 105117217 is about 10252.6687745191. The cubic root of 105117217 is about 471.9448863758.
Adding to 105117217 its reverse (712711501), we get a palindrome (817828718).
The spelling of 105117217 in words is "one hundred five million, one hundred seventeen thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •