Search a number
-
+
69358141637 is a prime number
BaseRepresentation
bin100000010011000010…
…0010100000011000101
320122000200120122201122
41000212010110003011
52114021141013022
651510201403325
75003521322321
oct1004604240305
9218020518648
1069358141637
1127461954414
1211537a99545
1367044843c5
1434dd694981
151c0e0c5742
hex10261140c5

69358141637 has 2 divisors, whose sum is σ = 69358141638. Its totient is φ = 69358141636.

The previous prime is 69358141499. The next prime is 69358141639. The reversal of 69358141637 is 73614185396.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 68543952481 + 814189156 = 261809^2 + 28534^2 .

It is a cyclic number.

It is not a de Polignac number, because 69358141637 - 228 = 69089706181 is a prime.

It is a super-2 number, since 2×693581416372 (a number of 22 digits) contains 22 as substring.

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

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 269358141637 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 3265920, while the sum is 53.

The spelling of 69358141637 in words is "sixty-nine billion, three hundred fifty-eight million, one hundred forty-one thousand, six hundred thirty-seven".