Search a number
-
+
64005041 is a prime number
BaseRepresentation
bin1111010000101…
…0001110110001
311110102210102002
43310022032301
5112341130131
610203503345
71405014422
oct364121661
9143383362
1064005041
1133146a31
1219527b55
131034cc09
148701649
1559446cb
hex3d0a3b1

64005041 has 2 divisors, whose sum is σ = 64005042. Its totient is φ = 64005040.

The previous prime is 64005031. The next prime is 64005077. The reversal of 64005041 is 14050046.

It is a happy number.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 64000000 + 5041 = 8000^2 + 71^2 .

It is a cyclic number.

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

It is a Chen prime.

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

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

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

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

Almost surely, 264005041 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 480, while the sum is 20.

The square root of 64005041 is about 8000.3150562962. The cubic root of 64005041 is about 400.0105018076.

Adding to 64005041 its reverse (14050046), we get a palindrome (78055087).

It can be divided in two parts, 6400 and 5041, that multiplied together give a square (32262400 = 56802).

The spelling of 64005041 in words is "sixty-four million, five thousand, forty-one".