Search a number
-
+
111001199971 is a prime number
BaseRepresentation
bin110011101100000101…
…1111110010101100011
3101121111212100012112111
41213120023332111203
53304312301344341
6122554312540151
711006466426544
oct1473013762543
9347455305474
10111001199971
1143091313502
121961a0b1657
13a60ca6731c
1455301644cb
152d49e64681
hex19d82fe563

111001199971 has 2 divisors, whose sum is σ = 111001199972. Its totient is φ = 111001199970.

The previous prime is 111001199941. The next prime is 111001200029. The reversal of 111001199971 is 179991100111.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 111001199971 - 27 = 111001199843 is a prime.

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

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

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

Almost surely, 2111001199971 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 5103, while the sum is 40.

The spelling of 111001199971 in words is "one hundred eleven billion, one million, one hundred ninety-nine thousand, nine hundred seventy-one".