Base | Representation |
---|---|
bin | 101001011110011… |
… | …011010100001001 |
3 | 1210111100102212001 |
4 | 221132123110021 |
5 | 2411113421212 |
6 | 153014151001 |
7 | 23146363021 |
oct | 5136332411 |
9 | 1714312761 |
10 | 695842057 |
11 | 32786a489 |
12 | 175052461 |
13 | b1214981 |
14 | 685b4a81 |
15 | 41150657 |
hex | 2979b509 |
695842057 has 2 divisors, whose sum is σ = 695842058. Its totient is φ = 695842056.
The previous prime is 695842019. The next prime is 695842061. The reversal of 695842057 is 750248596.
695842057 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., 509901561 + 185940496 = 22581^2 + 13636^2 .
It is a cyclic number.
It is not a de Polignac number, because 695842057 - 211 = 695840009 is a prime.
It is equal to p36048988 and since 695842057 and 36048988 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 695841998 and 695842016.
It is not a weakly prime, because it can be changed into another prime (695842087) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 347921028 + 347921029.
It is an arithmetic number, because the mean of its divisors is an integer number (347921029).
Almost surely, 2695842057 is an apocalyptic number.
It is an amenable number.
695842057 is a deficient number, since it is larger than the sum of its proper divisors (1).
695842057 is an equidigital number, since it uses as much as digits as its factorization.
695842057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 604800, while the sum is 46.
The square root of 695842057 is about 26378.8183397210. The cubic root of 695842057 is about 886.1424835437.
The spelling of 695842057 in words is "six hundred ninety-five million, eight hundred forty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •