Base | Representation |
---|---|
bin | 1100101110000… |
… | …01111100110101 |
3 | 21102202221200222 |
4 | 12113001330311 |
5 | 204303404342 |
6 | 14330544125 |
7 | 2433640313 |
oct | 627017465 |
9 | 242687628 |
10 | 106700597 |
11 | 55258813 |
12 | 2b898045 |
13 | 1914b663 |
14 | 102570b3 |
15 | 9579ed2 |
hex | 65c1f35 |
106700597 has 2 divisors, whose sum is σ = 106700598. Its totient is φ = 106700596.
The previous prime is 106700579. The next prime is 106700609. The reversal of 106700597 is 795007601.
Together with previous prime (106700579) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 71250481 + 35450116 = 8441^2 + 5954^2 .
It is a cyclic number.
It is not a de Polignac number, because 106700597 - 26 = 106700533 is a prime.
It is a super-2 number, since 2×1067005972 = 22770034800312818, which contains 22 as substring.
It is equal to p6124679 and since 106700597 and 6124679 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106700557) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53350298 + 53350299.
It is an arithmetic number, because the mean of its divisors is an integer number (53350299).
Almost surely, 2106700597 is an apocalyptic number.
It is an amenable number.
106700597 is a deficient number, since it is larger than the sum of its proper divisors (1).
106700597 is an equidigital number, since it uses as much as digits as its factorization.
106700597 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13230, while the sum is 35.
The square root of 106700597 is about 10329.5981044763. The cubic root of 106700597 is about 474.3027213408.
The spelling of 106700597 in words is "one hundred six million, seven hundred thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •