Search a number
-
+
66150947 is a prime number
BaseRepresentation
bin1111110001011…
…0001000100011
311121110211001002
43330112020203
5113413312242
610321502215
71432162622
oct374261043
9147424032
1066150947
1134382205
121a1a196b
1310921895
148add6b9
155c1a432
hex3f16223

66150947 has 2 divisors, whose sum is σ = 66150948. Its totient is φ = 66150946.

The previous prime is 66150937. The next prime is 66151031. The reversal of 66150947 is 74905166.

66150947 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 is a cyclic number.

It is not a de Polignac number, because 66150947 - 212 = 66146851 is a prime.

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 66150947.

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

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

Almost surely, 266150947 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 45360, while the sum is 38.

The square root of 66150947 is about 8133.3232445293. The cubic root of 66150947 is about 404.4318548898.

The spelling of 66150947 in words is "sixty-six million, one hundred fifty thousand, nine hundred forty-seven".