Search a number
-
+
916505985013 is a prime number
BaseRepresentation
bin11010101011001000000…
…00110111111111110101
310020121122212200222222121
431111210000313333311
5110004001013010023
61541011555555541
7123133605222553
oct15254400677765
93217585628877
10916505985013
1132376280a723
1212975bbbbbb1
1368570311648
143250562abd3
1518c9166dd5d
hexd564037ff5

916505985013 has 2 divisors, whose sum is σ = 916505985014. Its totient is φ = 916505985012.

The previous prime is 916505984987. The next prime is 916505985041. The reversal of 916505985013 is 310589505619.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 801379459204 + 115126525809 = 895198^2 + 339303^2 .

It is a cyclic number.

It is not a de Polignac number, because 916505985013 - 213 = 916505976821 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2916505985013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1458000, while the sum is 52.

The spelling of 916505985013 in words is "nine hundred sixteen billion, five hundred five million, nine hundred eighty-five thousand, thirteen".