Base | Representation |
---|---|
bin | 101001011111110… |
… | …110001000101101 |
3 | 1210112001100010222 |
4 | 221133312020231 |
5 | 2411212322221 |
6 | 153030141125 |
7 | 23152502414 |
oct | 5137661055 |
9 | 1715040128 |
10 | 696214061 |
11 | 327aa3a24 |
12 | 1751b17a5 |
13 | b13150aa |
14 | 6867047b |
15 | 411c59ab |
hex | 297f622d |
696214061 has 2 divisors, whose sum is σ = 696214062. Its totient is φ = 696214060.
The previous prime is 696214009. The next prime is 696214069. The reversal of 696214061 is 160412696.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 665898025 + 30316036 = 25805^2 + 5506^2 .
It is a cyclic number.
It is not a de Polignac number, because 696214061 - 26 = 696213997 is a prime.
It is a super-2 number, since 2×6962140612 = 969428037468223442, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (696214069) 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, 348107030 + 348107031.
It is an arithmetic number, because the mean of its divisors is an integer number (348107031).
Almost surely, 2696214061 is an apocalyptic number.
It is an amenable number.
696214061 is a deficient number, since it is larger than the sum of its proper divisors (1).
696214061 is an equidigital number, since it uses as much as digits as its factorization.
696214061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 35.
The square root of 696214061 is about 26385.8685852863. The cubic root of 696214061 is about 886.3003689039.
The spelling of 696214061 in words is "six hundred ninety-six million, two hundred fourteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.598 sec. • engine limits •