Search a number
-
+
111001009969079 is a prime number
BaseRepresentation
bin11001001111010001101111…
…110001001101011110110111
3112120000121000020101221201022
4121033101233301031132313
5104022120032023002304
61032025054321251355
732244362335050056
oct3117215761153667
9476017006357638
10111001009969079
113240629a37887a
12105488a5793b5b
1349c2472887929
141d5a69856c39d
15cc75ce978ebe
hex64f46fc4d7b7

111001009969079 has 2 divisors, whose sum is σ = 111001009969080. Its totient is φ = 111001009969078.

The previous prime is 111001009969039. The next prime is 111001009969103. The reversal of 111001009969079 is 970969900100111.

It is a strong prime.

It is a cyclic number.

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

It is a super-2 number, since 2×1110010099690792 (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 111001009969079.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (111001009969009) 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, 55500504984539 + 55500504984540.

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

Almost surely, 2111001009969079 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 275562, while the sum is 53.

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