Base | Representation |
---|---|
bin | 1100101101010… |
… | …11111001111001 |
3 | 21102121100211112 |
4 | 12112223321321 |
5 | 204243012142 |
6 | 14325010105 |
7 | 2433113123 |
oct | 626537171 |
9 | 242540745 |
10 | 106610297 |
11 | 551a6992 |
12 | 2b853935 |
13 | 19119521 |
14 | 10232213 |
15 | 955d382 |
hex | 65abe79 |
106610297 has 2 divisors, whose sum is σ = 106610298. Its totient is φ = 106610296.
The previous prime is 106610269. The next prime is 106610299. The reversal of 106610297 is 792016601.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97990201 + 8620096 = 9899^2 + 2936^2 .
It is a cyclic number.
It is not a de Polignac number, because 106610297 - 26 = 106610233 is a prime.
It is a super-2 number, since 2×1066102972 = 22731510852856418, which contains 22 as substring.
Together with 106610299, 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 (106610299) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53305148 + 53305149.
It is an arithmetic number, because the mean of its divisors is an integer number (53305149).
Almost surely, 2106610297 is an apocalyptic number.
It is an amenable number.
106610297 is a deficient number, since it is larger than the sum of its proper divisors (1).
106610297 is an equidigital number, since it uses as much as digits as its factorization.
106610297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 32.
The square root of 106610297 is about 10325.2262444946. The cubic root of 106610297 is about 474.1688838405.
Adding to 106610297 its reverse (792016601), we get a palindrome (898626898).
The spelling of 106610297 in words is "one hundred six million, six hundred ten thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •