Search a number
-
+
1110100100969 is a prime number
BaseRepresentation
bin10000001001110111000…
…111110100011101101001
310221010100210012001120102
4100021313013310131221
5121141441111212334
62205550053435145
7143126213112026
oct20116707643551
93833323161512
101110100100969
11398877626382
1215b18a33bab5
13808b3443192
143ba2ca4654d
151dd2253367e
hex102771f4769

1110100100969 has 2 divisors, whose sum is σ = 1110100100970. Its totient is φ = 1110100100968.

The previous prime is 1110100100953. The next prime is 1110100101037. The reversal of 1110100100969 is 9690010010111.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1102157726569 + 7942374400 = 1049837^2 + 89120^2 .

It is a cyclic number.

It is not a de Polignac number, because 1110100100969 - 24 = 1110100100953 is a prime.

It is a super-2 number, since 2×11101001009692 (a number of 25 digits) contains 22 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 (1110100100939) by changing a digit.

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

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

Almost surely, 21110100100969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 486, while the sum is 29.

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