Search a number
-
+
45914167913 is a prime number
BaseRepresentation
bin101010110000101100…
…101001101001101001
311101111211121101200112
4222300230221221221
51223013011333123
633032003544105
73213536662565
oct526054515151
9141454541615
1045914167913
1118521394a19
128a9468b035
1344394284c3
142317c366a5
1512dad17d78
hexab0b29a69

45914167913 has 2 divisors, whose sum is σ = 45914167914. Its totient is φ = 45914167912.

The previous prime is 45914167877. The next prime is 45914167927. The reversal of 45914167913 is 31976141954.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 25916814169 + 19997353744 = 160987^2 + 141412^2 .

It is a cyclic number.

It is not a de Polignac number, because 45914167913 - 212 = 45914163817 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

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

Almost surely, 245914167913 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 45914167913 in words is "forty-five billion, nine hundred fourteen million, one hundred sixty-seven thousand, nine hundred thirteen".