Search a number
-
+
66292033 is a prime number
BaseRepresentation
bin1111110011100…
…0100101000001
311121201222120111
43330320211001
5113432321113
610324511321
71433321143
oct374704501
9147658514
1066292033
1134469205
121a24b541
1310970b72
148b38c93
155c4713d
hex3f38941

66292033 has 2 divisors, whose sum is σ = 66292034. Its totient is φ = 66292032.

The previous prime is 66292021. The next prime is 66292087. The reversal of 66292033 is 33029266.

66292033 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., 59490369 + 6801664 = 7713^2 + 2608^2 .

It is a cyclic number.

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

It is equal to p3912394 and since 66292033 and 3912394 have the same sum of digits, it is a Honaker prime.

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

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

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

Almost surely, 266292033 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11664, while the sum is 31.

The square root of 66292033 is about 8141.9919552896. The cubic root of 66292033 is about 404.7191733025.

The spelling of 66292033 in words is "sixty-six million, two hundred ninety-two thousand, thirty-three".