Search a number
-
+
1110120012119 is a prime number
BaseRepresentation
bin10000001001111000010…
…011110001100101010111
310221010102011122122112102
4100021320103301211113
5121142011210341434
62205552044312315
7143126544261026
oct20117023614527
93833364578472
101110120012119
11398887895978
1215b194b4269b
13808b75c5021
143ba3154a8bd
151dd2416807e
hex102784f1957

1110120012119 has 2 divisors, whose sum is σ = 1110120012120. Its totient is φ = 1110120012118.

The previous prime is 1110120012049. The next prime is 1110120012139. The reversal of 1110120012119 is 9112100210111.

It is an a-pointer prime, because the next prime (1110120012139) can be obtained adding 1110120012119 to its sum of digits (20).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1110120012119 - 216 = 1110119946583 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 1110120012119.

It is a congruent number.

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

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

Almost surely, 21110120012119 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 36, while the sum is 20.

The spelling of 1110120012119 in words is "one trillion, one hundred ten billion, one hundred twenty million, twelve thousand, one hundred nineteen".