Search a number
-
+
111012201102169 is a prime number
BaseRepresentation
bin11001001111011100001010…
…110011111111101101011001
3112120001122220011111102021001
4121033130022303333231121
5104022310441440232134
61032034145014145001
732245236555110203
oct3117341263775531
9476048804442231
10111012201102169
11324100124927a4
121054aaa9652161
1349c3537283683
141d5b03a993773
15cc7a371c0414
hex64f70acffb59

111012201102169 has 2 divisors, whose sum is σ = 111012201102170. Its totient is φ = 111012201102168.

The previous prime is 111012201102053. The next prime is 111012201102193. The reversal of 111012201102169 is 961201102210111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 87252786446400 + 23759414655769 = 9340920^2 + 4874363^2 .

It is a cyclic number.

It is not a de Polignac number, because 111012201102169 - 217 = 111012200971097 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

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

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

Almost surely, 2111012201102169 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 432, while the sum is 28.

The spelling of 111012201102169 in words is "one hundred eleven trillion, twelve billion, two hundred one million, one hundred two thousand, one hundred sixty-nine".