Base | Representation |
---|---|
bin | 101001100000100… |
… | …001111011010111 |
3 | 1210112101110012022 |
4 | 221200201323113 |
5 | 2411234042211 |
6 | 153034043355 |
7 | 23154150356 |
oct | 5140417327 |
9 | 1715343168 |
10 | 696393431 |
11 | 328106768 |
12 | 17527955b |
13 | b1378926 |
14 | 686b999d |
15 | 4120dbdb |
hex | 29821ed7 |
696393431 has 2 divisors, whose sum is σ = 696393432. Its totient is φ = 696393430.
The previous prime is 696393413. The next prime is 696393433. The reversal of 696393431 is 134393696.
696393431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (696393413) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 696393431 - 218 = 696131287 is a prime.
It is a super-2 number, since 2×6963934312 = 969927621479903522, which contains 22 as substring.
Together with 696393433, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (696393433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 348196715 + 348196716.
It is an arithmetic number, because the mean of its divisors is an integer number (348196716).
Almost surely, 2696393431 is an apocalyptic number.
696393431 is a deficient number, since it is larger than the sum of its proper divisors (1).
696393431 is an equidigital number, since it uses as much as digits as its factorization.
696393431 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 314928, while the sum is 44.
The square root of 696393431 is about 26389.2673448885. The cubic root of 696393431 is about 886.3764767446.
The spelling of 696393431 in words is "six hundred ninety-six million, three hundred ninety-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •