Search a number
-
+
69390029 is a prime number
BaseRepresentation
bin1000010001011…
…00111011001101
311211120101020002
410020230323031
5120230440104
610515134045
71501543202
oct410547315
9154511202
1069390029
1136194835
121b2a4325
13114b6cb7
149303ca9
15615a01e
hex422cecd

69390029 has 2 divisors, whose sum is σ = 69390030. Its totient is φ = 69390028.

The previous prime is 69389993. The next prime is 69390031. The reversal of 69390029 is 92009396.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 66797929 + 2592100 = 8173^2 + 1610^2 .

It is a cyclic number.

It is not a de Polignac number, because 69390029 - 212 = 69385933 is a prime.

It is a super-3 number, since 3×693900293 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 69389974 and 69390001.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (69390829) 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, 34695014 + 34695015.

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

Almost surely, 269390029 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 26244, while the sum is 38.

The square root of 69390029 is about 8330.0677668312. The cubic root of 69390029 is about 410.9279576468.

The spelling of 69390029 in words is "sixty-nine million, three hundred ninety thousand, twenty-nine".