Search a number
-
+
64314721965313 is a prime number
BaseRepresentation
bin11101001111110011100000…
…01010000001010100000001
322102201102112112222120110001
432213321300022001110001
531412213022310342223
6344441435252240001
716355404523466661
oct1647716012012401
9272642475876401
1064314721965313
11195467a1960456
12726875a310001
1329b6b105448b1
1411c4bc61061a1
15767e909109ad
hex3a7e70281501

64314721965313 has 2 divisors, whose sum is σ = 64314721965314. Its totient is φ = 64314721965312.

The previous prime is 64314721965223. The next prime is 64314721965359. The reversal of 64314721965313 is 31356912741346.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 64160228160064 + 154493805249 = 8010008^2 + 393057^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-64314721965313 is a prime.

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

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

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

Almost surely, 264314721965313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 9797760, while the sum is 55.

The spelling of 64314721965313 in words is "sixty-four trillion, three hundred fourteen billion, seven hundred twenty-one million, nine hundred sixty-five thousand, three hundred thirteen".