Search a number
-
+
1110122200969 is a prime number
BaseRepresentation
bin10000001001111000011…
…100000111111110001001
310221010102022202212001221
4100021320130013332021
5121142012240412334
62205552203242041
7143126602005355
oct20117034077611
93833368685057
101110122200969
11398889050441
1215b195819321
13808b7bb03c2
143ba3195a465
151dd2444b8b4
hex10278707f89

1110122200969 has 2 divisors, whose sum is σ = 1110122200970. Its totient is φ = 1110122200968.

The previous prime is 1110122200939. The next prime is 1110122201017. The reversal of 1110122200969 is 9690022210111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1099572446025 + 10549754944 = 1048605^2 + 102712^2 .

It is an emirp because it is prime and its reverse (9690022210111) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1110122200969 - 27 = 1110122200841 is a prime.

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

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

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

Almost surely, 21110122200969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3888, while the sum is 34.

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