Search a number
-
+
694806613 is a prime number
BaseRepresentation
bin101001011010011…
…110100001010101
31210102101211111021
4221122132201111
52410332302423
6152540041141
723134521154
oct5132364125
91712354437
10694806613
11327222546
121748331b1
13b0c41597
14683c559b
1540ee895d
hex2969e855

694806613 has 2 divisors, whose sum is σ = 694806614. Its totient is φ = 694806612.

The previous prime is 694806583. The next prime is 694806631. The reversal of 694806613 is 316608496.

694806613 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

Together with next prime (694806631) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 606784689 + 88021924 = 24633^2 + 9382^2 .

It is a cyclic number.

It is not a de Polignac number, because 694806613 - 221 = 692709461 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2694806613 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 186624, while the sum is 43.

The square root of 694806613 is about 26359.1846042324. The cubic root of 694806613 is about 885.7027255057.

The spelling of 694806613 in words is "six hundred ninety-four million, eight hundred six thousand, six hundred thirteen".