Search a number
-
+
69514381 is a prime number
BaseRepresentation
bin1000010010010…
…11010010001101
311211210200210201
410021023102031
5120243430011
610521533501
71502601556
oct411132215
9154720721
1069514381
113626a202
121b344291
131152b791
14933732d
156181cc1
hex424b48d

69514381 has 2 divisors, whose sum is σ = 69514382. Its totient is φ = 69514380.

The previous prime is 69514373. The next prime is 69514387. The reversal of 69514381 is 18341596.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 68392900 + 1121481 = 8270^2 + 1059^2 .

It is a cyclic number.

It is not a de Polignac number, because 69514381 - 23 = 69514373 is a prime.

It is a super-2 number, since 2×695143812 = 9664498331626322, which contains 22 as substring.

It is a Chen prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 269514381 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 25920, while the sum is 37.

The square root of 69514381 is about 8337.5284707160. The cubic root of 69514381 is about 411.1732821297.

The spelling of 69514381 in words is "sixty-nine million, five hundred fourteen thousand, three hundred eighty-one".