Search a number
-
+
1110660011497 is a prime number
BaseRepresentation
bin10000001010011000011…
…111101101010111101001
310221011210210202110102101
4100022120133231113221
5121144112430331442
62210121414333401
7143146122221161
oct20123037552751
93834723673371
101110660011497
11399034692453
1215b30595a261
138097244359a
143ba831555a1
151dd56782cb7
hex102987ed5e9

1110660011497 has 2 divisors, whose sum is σ = 1110660011498. Its totient is φ = 1110660011496.

The previous prime is 1110660011479. The next prime is 1110660011521. The reversal of 1110660011497 is 7941100660111.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1108000443456 + 2659568041 = 1052616^2 + 51571^2 .

It is a cyclic number.

It is not a de Polignac number, because 1110660011497 - 27 = 1110660011369 is a prime.

It is a super-3 number, since 3×11106600114973 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

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

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

Almost surely, 21110660011497 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9072, while the sum is 37.

The spelling of 1110660011497 in words is "one trillion, one hundred ten billion, six hundred sixty million, eleven thousand, four hundred ninety-seven".