Search a number
-
+
64928191961 is a prime number
BaseRepresentation
bin111100011110000001…
…011001010111011001
320012120221211220012102
4330132001121113121
52030433104120321
645454432253145
74455660345203
oct743601312731
9205527756172
1064928191961
11255992a9686
12107003a11b5
1361797662c9
1431dd1c1773
151a50222c0b
hexf1e0595d9

64928191961 has 2 divisors, whose sum is σ = 64928191962. Its totient is φ = 64928191960.

The previous prime is 64928191957. The next prime is 64928192011. The reversal of 64928191961 is 16919182946.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 60199566736 + 4728625225 = 245356^2 + 68765^2 .

It is a cyclic number.

It is not a de Polignac number, because 64928191961 - 22 = 64928191957 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 64928191897 and 64928191906.

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

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

Almost surely, 264928191961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 1679616, while the sum is 56.

The spelling of 64928191961 in words is "sixty-four billion, nine hundred twenty-eight million, one hundred ninety-one thousand, nine hundred sixty-one".