Search a number
-
+
66757314731 is a prime number
BaseRepresentation
bin111110001011000010…
…111100100010101011
320101022102122221221012
4332023002330202223
52043204333032411
650400132534135
74552210545512
oct761302744253
9211272587835
1066757314731
1126347844698
1210b30a8134b
1363ab6b1c83
1433340b9679
151b0aad018b
hexf8b0bc8ab

66757314731 has 2 divisors, whose sum is σ = 66757314732. Its totient is φ = 66757314730.

The previous prime is 66757314727. The next prime is 66757314733. The reversal of 66757314731 is 13741375766.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 66757314731 - 22 = 66757314727 is a prime.

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

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

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 66757314731.

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

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

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

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

Almost surely, 266757314731 is an apocalyptic number.

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

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

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

The product of its digits is 2222640, while the sum is 50.

The spelling of 66757314731 in words is "sixty-six billion, seven hundred fifty-seven million, three hundred fourteen thousand, seven hundred thirty-one".