Search a number
-
+
111303221969 is a prime number
BaseRepresentation
bin110011110101000110…
…0000110001011010001
3101122021220122111211102
41213222030012023101
53310422111100334
6123044302154145
711020124530262
oct1475214061321
9348256574742
10111303221969
1143226849065
12196a3282955
13a65a4c2574
14555c302969
152d6672267e
hex19ea3062d1

111303221969 has 2 divisors, whose sum is σ = 111303221970. Its totient is φ = 111303221968.

The previous prime is 111303221959. The next prime is 111303222011. The reversal of 111303221969 is 969122303111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 100829746369 + 10473475600 = 317537^2 + 102340^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-111303221969 is a prime.

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

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

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

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

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

Almost surely, 2111303221969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 17496, while the sum is 38.

The spelling of 111303221969 in words is "one hundred eleven billion, three hundred three million, two hundred twenty-one thousand, nine hundred sixty-nine".