Search a number
-
+
111012000121013 is a prime number
BaseRepresentation
bin11001001111011011111110…
…110101010100000010110101
3112120001122101011022111221112
4121033123332311110002311
5104022310034012333023
61032034113034324405
732245231564565255
oct3117337665240265
9476048334274845
10111012000121013
113240aa19a9a672
121054aa52289705
1349c3504744904
141d5b01bdd7965
15cc7a24720478
hex64f6fed540b5

111012000121013 has 2 divisors, whose sum is σ = 111012000121014. Its totient is φ = 111012000121012.

The previous prime is 111012000120943. The next prime is 111012000121031. The reversal of 111012000121013 is 310121000210111.

Together with next prime (111012000121031) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 110973204121924 + 38795999089 = 10534382^2 + 196967^2 .

It is a cyclic number.

It is not a de Polignac number, because 111012000121013 - 212 = 111012000116917 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2111012000121013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12, while the sum is 14.

Adding to 111012000121013 its reverse (310121000210111), we get a palindrome (421133000331124).

The spelling of 111012000121013 in words is "one hundred eleven trillion, twelve billion, one hundred twenty-one thousand, thirteen".