Base | Representation |
---|---|
bin | 101000100010… |
… | …100000101101 |
3 | 201222220122221 |
4 | 220202200231 |
5 | 10210031432 |
6 | 1015435341 |
7 | 156220564 |
oct | 50424055 |
9 | 21886587 |
10 | 10627117 |
11 | 5aa9346 |
12 | 3685b51 |
13 | 2281147 |
14 | 15a8bdb |
15 | dedb97 |
hex | a2282d |
10627117 has 2 divisors, whose sum is σ = 10627118. Its totient is φ = 10627116.
The previous prime is 10627109. The next prime is 10627157. The reversal of 10627117 is 71172601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10536516 + 90601 = 3246^2 + 301^2 .
It is a cyclic number.
It is not a de Polignac number, because 10627117 - 23 = 10627109 is a prime.
It is a super-2 number, since 2×106271172 = 225871231463378, which contains 22 as substring.
It is equal to p703465 and since 10627117 and 703465 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 10627091 and 10627100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10627157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5313558 + 5313559.
It is an arithmetic number, because the mean of its divisors is an integer number (5313559).
Almost surely, 210627117 is an apocalyptic number.
It is an amenable number.
10627117 is a deficient number, since it is larger than the sum of its proper divisors (1).
10627117 is an equidigital number, since it uses as much as digits as its factorization.
10627117 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 10627117 is about 3259.9259194037. The cubic root of 10627117 is about 219.8560835613.
Adding to 10627117 its reverse (71172601), we get a palindrome (81799718).
The spelling of 10627117 in words is "ten million, six hundred twenty-seven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •