Base | Representation |
---|---|
bin | 1100101101101… |
… | …11001000000001 |
3 | 21102200200212202 |
4 | 12112313020001 |
5 | 204301000012 |
6 | 14330002545 |
7 | 2433364121 |
oct | 626671001 |
9 | 242620782 |
10 | 106656257 |
11 | 55228474 |
12 | 2b876455 |
13 | 19134416 |
14 | 10244c81 |
15 | 956bcc2 |
hex | 65b7201 |
106656257 has 2 divisors, whose sum is σ = 106656258. Its totient is φ = 106656256.
The previous prime is 106656233. The next prime is 106656259. The reversal of 106656257 is 752656601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 71893441 + 34762816 = 8479^2 + 5896^2 .
It is an emirp because it is prime and its reverse (752656601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 106656257 - 210 = 106655233 is a prime.
It is a super-2 number, since 2×1066562572 = 22751114314500098, which contains 22 as substring.
Together with 106656259, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 106656257.
It is not a weakly prime, because it can be changed into another prime (106656259) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53328128 + 53328129.
It is an arithmetic number, because the mean of its divisors is an integer number (53328129).
Almost surely, 2106656257 is an apocalyptic number.
It is an amenable number.
106656257 is a deficient number, since it is larger than the sum of its proper divisors (1).
106656257 is an equidigital number, since it uses as much as digits as its factorization.
106656257 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 75600, while the sum is 38.
The square root of 106656257 is about 10327.4516217700. The cubic root of 106656257 is about 474.2370125661.
The spelling of 106656257 in words is "one hundred six million, six hundred fifty-six thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •