Search a number
-
+
1110102002069 is a prime number
BaseRepresentation
bin10000001001110111001…
…111000100100110010101
310221010100220202122101112
4100021313033010212111
5121141442103031234
62205550202304405
7143126235220424
oct20116717044625
93833326678345
101110102002069
11398878704735
1215b18aab8105
13808b395a5a8
143ba2cdbd2bb
151dd227abace
hex102773c4995

1110102002069 has 2 divisors, whose sum is σ = 1110102002070. Its totient is φ = 1110102002068.

The previous prime is 1110102002063. The next prime is 1110102002071. The reversal of 1110102002069 is 9602002010111.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 887919867025 + 222182135044 = 942295^2 + 471362^2 .

It is a cyclic number.

It is not a de Polignac number, because 1110102002069 - 236 = 1041382525333 is a prime.

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

Together with 1110102002071, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 21110102002069 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 216, while the sum is 23.

The spelling of 1110102002069 in words is "one trillion, one hundred ten billion, one hundred two million, two thousand, sixty-nine".