Search a number
-
+
66096229 is a prime number
BaseRepresentation
bin1111110000100…
…0110001100101
311121101000222111
43330020301211
5113410034404
610320401021
71431544243
oct374106145
9147330874
1066096229
1134345091
121a176171
13109029c4
148ac7793
155c09104
hex3f08c65

66096229 has 2 divisors, whose sum is σ = 66096230. Its totient is φ = 66096228.

The previous prime is 66096211. The next prime is 66096257. The reversal of 66096229 is 92269066.

66096229 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., 33663204 + 32433025 = 5802^2 + 5695^2 .

It is a cyclic number.

It is not a de Polignac number, because 66096229 - 215 = 66063461 is a prime.

It is a super-2 number, since 2×660962292 = 8737422976040882, which contains 22 as substring.

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

It is a congruent number.

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

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

Almost surely, 266096229 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 69984, while the sum is 40.

The square root of 66096229 is about 8129.9587329826. The cubic root of 66096229 is about 404.3203129910.

The spelling of 66096229 in words is "sixty-six million, ninety-six thousand, two hundred twenty-nine".