Search a number
-
+
699192113 is a prime number
BaseRepresentation
bin101001101011001…
…101001100110001
31210201122122021012
4221223031030301
52412443121423
6153214040305
723220014654
oct5153151461
91721578235
10699192113
11329748424
121761a9095
13b1b18759
1468c0789b
15415b3078
hex29acd331

699192113 has 2 divisors, whose sum is σ = 699192114. Its totient is φ = 699192112.

The previous prime is 699192041. The next prime is 699192139. The reversal of 699192113 is 311291996.

699192113 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., 679540624 + 19651489 = 26068^2 + 4433^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-699192113 is a prime.

It is a super-4 number, since 4×6991921134 (a number of 36 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 2699192113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 26244, while the sum is 41.

The square root of 699192113 is about 26442.2410737063. The cubic root of 699192113 is about 887.5622863909.

The spelling of 699192113 in words is "six hundred ninety-nine million, one hundred ninety-two thousand, one hundred thirteen".