Search a number
-
+
667367104727431 is a prime number
BaseRepresentation
bin1001011110111101111000001…
…1001101100100100110000111
310020111221200010222120001101001
42113233132003031210212013
51144433120312302234211
610323212114312514131
7260366452663330303
oct22757360315444607
93214850128501331
10667367104727431
11183709888437609
1262a242710ab947
132284c5a9182934
14bab2a51210d03
155224b3ae85ac1
hex25ef783364987

667367104727431 has 2 divisors, whose sum is σ = 667367104727432. Its totient is φ = 667367104727430.

The previous prime is 667367104727413. The next prime is 667367104727437. The reversal of 667367104727431 is 134727401763766.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 667367104727431 - 25 = 667367104727399 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2667367104727431 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 149361408, while the sum is 64.

The spelling of 667367104727431 in words is "six hundred sixty-seven trillion, three hundred sixty-seven billion, one hundred four million, seven hundred twenty-seven thousand, four hundred thirty-one".