Base | Representation |
---|---|
bin | 1100001011000… |
… | …01111101011101 |
3 | 21010010212212022 |
4 | 12011201331131 |
5 | 202120104432 |
6 | 14044345525 |
7 | 2346642611 |
oct | 605417535 |
9 | 233125768 |
10 | 102113117 |
11 | 52705107 |
12 | 2a2452a5 |
13 | 18203582 |
14 | d7c1341 |
15 | 8e70b12 |
hex | 6161f5d |
102113117 has 2 divisors, whose sum is σ = 102113118. Its totient is φ = 102113116.
The previous prime is 102113111. The next prime is 102113119. The reversal of 102113117 is 711311201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 84254041 + 17859076 = 9179^2 + 4226^2 .
It is an emirp because it is prime and its reverse (711311201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102113117 is a prime.
Together with 102113119, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 102113095 and 102113104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102113111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51056558 + 51056559.
It is an arithmetic number, because the mean of its divisors is an integer number (51056559).
Almost surely, 2102113117 is an apocalyptic number.
It is an amenable number.
102113117 is a deficient number, since it is larger than the sum of its proper divisors (1).
102113117 is an equidigital number, since it uses as much as digits as its factorization.
102113117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42, while the sum is 17.
The square root of 102113117 is about 10105.1035125821. The cubic root of 102113117 is about 467.4055279187.
Adding to 102113117 its reverse (711311201), we get a palindrome (813424318).
The spelling of 102113117 in words is "one hundred two million, one hundred thirteen thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •