Search a number
-
+
1110000011489 is a prime number
BaseRepresentation
bin10000001001110001001…
…010000000100011100001
310221010002210211222121122
4100021301022000203201
5121141240000331424
62205532120302025
7143123556264665
oct20116112004341
93833083758548
101110000011489
113988260836a6
1215b160911915
138089879aa35
143ba1d6308a5
151dd1886245e
hex102712808e1

1110000011489 has 2 divisors, whose sum is σ = 1110000011490. Its totient is φ = 1110000011488.

The previous prime is 1110000011467. The next prime is 1110000011501. The reversal of 1110000011489 is 9841100000111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1077894539089 + 32105472400 = 1038217^2 + 179180^2 .

It is a cyclic number.

It is not a de Polignac number, because 1110000011489 - 212 = 1110000007393 is a prime.

It is a super-3 number, since 3×11100000114893 (a number of 37 digits) contains 333 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 21110000011489 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 288, while the sum is 26.

The spelling of 1110000011489 in words is "one trillion, one hundred ten billion, eleven thousand, four hundred eighty-nine".