Base | Representation |
---|---|
bin | 1100001011000… |
… | …00100111100001 |
3 | 21010010121022121 |
4 | 12011200213201 |
5 | 202114420432 |
6 | 14044304241 |
7 | 2346620563 |
oct | 605404741 |
9 | 233117277 |
10 | 102107617 |
11 | 52700a67 |
12 | 2a242081 |
13 | 18200c11 |
14 | d7bd333 |
15 | 8e6e197 |
hex | 61609e1 |
102107617 has 2 divisors, whose sum is σ = 102107618. Its totient is φ = 102107616.
The previous prime is 102107581. The next prime is 102107659. The reversal of 102107617 is 716701201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 78836641 + 23270976 = 8879^2 + 4824^2 .
It is an emirp because it is prime and its reverse (716701201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102107617 - 211 = 102105569 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102107591 and 102107600.
It is not a weakly prime, because it can be changed into another prime (102104617) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51053808 + 51053809.
It is an arithmetic number, because the mean of its divisors is an integer number (51053809).
Almost surely, 2102107617 is an apocalyptic number.
It is an amenable number.
102107617 is a deficient number, since it is larger than the sum of its proper divisors (1).
102107617 is an equidigital number, since it uses as much as digits as its factorization.
102107617 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 588, while the sum is 25.
The square root of 102107617 is about 10104.8313692016. The cubic root of 102107617 is about 467.3971359947.
Adding to 102107617 its reverse (716701201), we get a palindrome (818808818).
The spelling of 102107617 in words is "one hundred two million, one hundred seven thousand, six hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •