Search a number
-
+
66055015121 is a prime number
BaseRepresentation
bin111101100001001011…
…111000101011010001
320022111111011102222112
4331201023320223101
52040240040440441
650202324115105
74525622236004
oct754113705321
9208444142875
1066055015121
1126017374597
1210975835a95
1362c9048c84
1432a8b0353b
151ab91064eb
hexf612f8ad1

66055015121 has 2 divisors, whose sum is σ = 66055015122. Its totient is φ = 66055015120.

The previous prime is 66055015097. The next prime is 66055015153. The reversal of 66055015121 is 12151055066.

It is an a-pointer prime, because the next prime (66055015153) can be obtained adding 66055015121 to its sum of digits (32).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 60189752896 + 5865262225 = 245336^2 + 76585^2 .

It is a cyclic number.

It is not a de Polignac number, because 66055015121 - 218 = 66054752977 is a prime.

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

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

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

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

Almost surely, 266055015121 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9000, while the sum is 32.

The spelling of 66055015121 in words is "sixty-six billion, fifty-five million, fifteen thousand, one hundred twenty-one".