Search a number
-
+
111101001010969 is a prime number
BaseRepresentation
bin11001010000101110110111…
…101100110000111100011001
3112120101011002210012011202011
4121100232313230300330121
5104030234322224322334
61032143032324305521
732254532242635454
oct3120566754607431
9476334083164664
10111101001010969
1132444740745582
12105641505422a1
1349cba1957bac8
141d6146233a49b
15cc9ed2ee4564
hex650bb7b30f19

111101001010969 has 2 divisors, whose sum is σ = 111101001010970. Its totient is φ = 111101001010968.

The previous prime is 111101001010877. The next prime is 111101001010981. The reversal of 111101001010969 is 969010100101111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 98378368076569 + 12722632934400 = 9918587^2 + 3566880^2 .

It is a cyclic number.

It is not a de Polignac number, because 111101001010969 - 29 = 111101001010457 is a prime.

It is a super-2 number, since 2×1111010010109692 (a number of 29 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 111101001010969.

It is not a weakly prime, because it can be changed into another prime (111101001010669) by changing a digit.

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

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

Almost surely, 2111101001010969 is an apocalyptic number.

It is an amenable number.

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

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

111101001010969 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 31.

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