Base | Representation |
---|---|
bin | 110000111100100100… |
… | …1001100110101100101 |
3 | 101001022102011002102011 |
4 | 1201321021030311211 |
5 | 3210232041420432 |
6 | 120142043514221 |
7 | 10410523311556 |
oct | 1417111146545 |
9 | 331272132364 |
10 | 105111670117 |
11 | 40639885563 |
12 | 18455828971 |
13 | 9bb183990c |
14 | 5131cb032d |
15 | 2b02d9d847 |
hex | 187924cd65 |
105111670117 has 2 divisors, whose sum is σ = 105111670118. Its totient is φ = 105111670116.
The previous prime is 105111670109. The next prime is 105111670171. The reversal of 105111670117 is 711076111501.
Together with next prime (105111670171) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 91561313281 + 13550356836 = 302591^2 + 116406^2 .
It is a cyclic number.
It is not a de Polignac number, because 105111670117 - 23 = 105111670109 is a prime.
It is a super-2 number, since 2×1051116701172 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105111670177) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52555835058 + 52555835059.
It is an arithmetic number, because the mean of its divisors is an integer number (52555835059).
Almost surely, 2105111670117 is an apocalyptic number.
It is an amenable number.
105111670117 is a deficient number, since it is larger than the sum of its proper divisors (1).
105111670117 is an equidigital number, since it uses as much as digits as its factorization.
105111670117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1470, while the sum is 31.
Adding to 105111670117 its reverse (711076111501), we get a palindrome (816187781618).
The spelling of 105111670117 in words is "one hundred five billion, one hundred eleven million, six hundred seventy thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •