Search a number
-
+
695036161 is a prime number
BaseRepresentation
bin101001011011010…
…110100100000001
31210102211111101001
4221123112210001
52410412124121
6152545012001
723136465331
oct5133264401
91712744331
10695036161
11327369a56
12174924001
13b0cc1c01
14684450c1
1541041991
hex296d6901

695036161 has 2 divisors, whose sum is σ = 695036162. Its totient is φ = 695036160.

The previous prime is 695036159. The next prime is 695036183. The reversal of 695036161 is 161630596.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 593409600 + 101626561 = 24360^2 + 10081^2 .

It is a cyclic number.

It is not a de Polignac number, because 695036161 - 21 = 695036159 is a prime.

It is a super-3 number, since 3×6950361613 (a number of 28 digits) contains 333 as substring.

Together with 695036159, it forms a pair of twin primes.

It is a self number, because there is not a number n which added to its sum of digits gives 695036161.

It is not a weakly prime, because it can be changed into another prime (695036191) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 347518080 + 347518081.

It is an arithmetic number, because the mean of its divisors is an integer number (347518081).

Almost surely, 2695036161 is an apocalyptic number.

It is an amenable number.

695036161 is a deficient number, since it is larger than the sum of its proper divisors (1).

695036161 is an equidigital number, since it uses as much as digits as its factorization.

695036161 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 29160, while the sum is 37.

The square root of 695036161 is about 26363.5384764640. The cubic root of 695036161 is about 885.8002533164.

The spelling of 695036161 in words is "six hundred ninety-five million, thirty-six thousand, one hundred sixty-one".