Search a number
-
+
66110423324537 is a prime number
BaseRepresentation
bin11110000100000100010000…
…10011000101011101111001
322200002002120001220011100002
433002002020103011131321
532131123121332341122
6352334413104322345
716632214630265444
oct1702021023053571
9280062501804302
1066110423324537
111a079300520659
1274b87870133b5
132ab7256025177
141247a93a2265b
15799a3cda2992
hex3c20884c5779

66110423324537 has 2 divisors, whose sum is σ = 66110423324538. Its totient is φ = 66110423324536.

The previous prime is 66110423324423. The next prime is 66110423324573. The reversal of 66110423324537 is 73542332401166.

Together with next prime (66110423324573) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 63036358927936 + 3074064396601 = 7939544^2 + 1753301^2 .

It is a cyclic number.

It is not a de Polignac number, because 66110423324537 - 240 = 65010911696761 is a prime.

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

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

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

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

Almost surely, 266110423324537 is an apocalyptic number.

It is an amenable number.

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

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

66110423324537 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 2177280, while the sum is 47.

The spelling of 66110423324537 in words is "sixty-six trillion, one hundred ten billion, four hundred twenty-three million, three hundred twenty-four thousand, five hundred thirty-seven".