Search a number
-
+
11660276765251 is a prime number
BaseRepresentation
bin1010100110101101111010…
…1001111001001001000011
31112021201012201212200002201
42221223132221321021003
53012020221322442001
640444353542054031
72312266346114662
oct251533651711103
945251181780081
1011660276765251
113796106284384
121383a0b11a317
13667736c6295a
142c4508d54dd9
1515349d1e9501
hexa9adea79243

11660276765251 has 2 divisors, whose sum is σ = 11660276765252. Its totient is φ = 11660276765250.

The previous prime is 11660276765243. The next prime is 11660276765273. The reversal of 11660276765251 is 15256767206611.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 11660276765251 - 23 = 11660276765243 is a prime.

It is a super-2 number, since 2×116602767652512 (a number of 27 digits) contains 22 as substring.

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

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

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

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

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

Almost surely, 211660276765251 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 6350400, while the sum is 55.

The spelling of 11660276765251 in words is "eleven trillion, six hundred sixty billion, two hundred seventy-six million, seven hundred sixty-five thousand, two hundred fifty-one".