Base | Representation |
---|---|
bin | 101001101110101… |
… | …100010110000101 |
3 | 1210210101002001012 |
4 | 221232230112011 |
5 | 2413211343432 |
6 | 153245412005 |
7 | 23230542464 |
oct | 5156542605 |
9 | 1723332035 |
10 | 700106117 |
11 | 32a2120a7 |
12 | 17656a005 |
13 | b2078799 |
14 | 68da49db |
15 | 416e3cb2 |
hex | 29bac585 |
700106117 has 2 divisors, whose sum is σ = 700106118. Its totient is φ = 700106116.
The previous prime is 700106063. The next prime is 700106123. The reversal of 700106117 is 711601007.
700106117 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 699549601 + 556516 = 26449^2 + 746^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-700106117 is a prime.
It is a super-3 number, since 3×7001061173 (a number of 28 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 700106092 and 700106101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (700106317) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 350053058 + 350053059.
It is an arithmetic number, because the mean of its divisors is an integer number (350053059).
Almost surely, 2700106117 is an apocalyptic number.
It is an amenable number.
700106117 is a deficient number, since it is larger than the sum of its proper divisors (1).
700106117 is an equidigital number, since it uses as much as digits as its factorization.
700106117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 294, while the sum is 23.
The square root of 700106117 is about 26459.5184574474. The cubic root of 700106117 is about 887.9488669560.
The spelling of 700106117 in words is "seven hundred million, one hundred six thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •