Search a number
-
+
64032461461027 is a prime number
BaseRepresentation
bin11101000111100101110000…
…00111101001011000100011
322101201102222100001022000201
432203302320013221120203
531343101440113223102
6344104035014130031
716326123042004603
oct1643627007513043
9271642870038021
1064032461461027
1119448018198914
127221b05950917
132996309996917
1411b528ad7cc03
157609707ed987
hex3a3cb81e9623

64032461461027 has 2 divisors, whose sum is σ = 64032461461028. Its totient is φ = 64032461461026.

The previous prime is 64032461460941. The next prime is 64032461461093. The reversal of 64032461461027 is 72016416423046.

64032461461027 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 64032461461027 - 215 = 64032461428259 is a prime.

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

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

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

Almost surely, 264032461461027 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1161216, while the sum is 46.

The spelling of 64032461461027 in words is "sixty-four trillion, thirty-two billion, four hundred sixty-one million, four hundred sixty-one thousand, twenty-seven".