Base | Representation |
---|---|
bin | 1100101010101… |
… | …11111111111001 |
3 | 21101221220101122 |
4 | 12111113333321 |
5 | 204201012432 |
6 | 14313355025 |
7 | 2430152132 |
oct | 625277771 |
9 | 241856348 |
10 | 106266617 |
11 | 54a91756 |
12 | 2b708a75 |
13 | 19028c72 |
14 | 10182c89 |
15 | 94e1612 |
hex | 6557ff9 |
106266617 has 2 divisors, whose sum is σ = 106266618. Its totient is φ = 106266616.
The previous prime is 106266593. The next prime is 106266619. The reversal of 106266617 is 716662601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96255721 + 10010896 = 9811^2 + 3164^2 .
It is an emirp because it is prime and its reverse (716662601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 106266617 - 218 = 106004473 is a prime.
It is a super-2 number, since 2×1062666172 = 22585187777249378, which contains 22 as substring.
Together with 106266619, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (106266619) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53133308 + 53133309.
It is an arithmetic number, because the mean of its divisors is an integer number (53133309).
Almost surely, 2106266617 is an apocalyptic number.
It is an amenable number.
106266617 is a deficient number, since it is larger than the sum of its proper divisors (1).
106266617 is an equidigital number, since it uses as much as digits as its factorization.
106266617 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 35.
The square root of 106266617 is about 10308.5700754275. The cubic root of 106266617 is about 473.6588086883.
The spelling of 106266617 in words is "one hundred six million, two hundred sixty-six thousand, six hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •