Search a number
-
+
111100100110121 is a prime number
BaseRepresentation
bin11001010000101110000010…
…000000000110011100101001
3112120101001202222222200010002
4121100232002000012130221
5104030231001112010441
61032142403103032345
732254501023255413
oct3120560200063451
9476331688880102
10111100100110121
1132444319158421
1210563b3a89b6b5
1349cb904a2b395
141d613b88279b3
15cc9e7dd8ab9b
hex650b82006729

111100100110121 has 2 divisors, whose sum is σ = 111100100110122. Its totient is φ = 111100100110120.

The previous prime is 111100100110049. The next prime is 111100100110151. The reversal of 111100100110121 is 121011001001111.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 108602243137600 + 2497856972521 = 10421240^2 + 1580461^2 .

It is a cyclic number.

It is not a de Polignac number, because 111100100110121 - 218 = 111100099847977 is a prime.

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

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

Almost surely, 2111100100110121 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2, while the sum is 11.

Adding to 111100100110121 its reverse (121011001001111), we get a palindrome (232111101111232).

The spelling of 111100100110121 in words is "one hundred eleven trillion, one hundred billion, one hundred million, one hundred ten thousand, one hundred twenty-one".