Search a number
-
+
1112101120313 is a prime number
BaseRepresentation
bin10000001011101110011…
…001000110100100111001
310221022112020110101001222
4100023232121012210321
5121210040341322223
62210520414321425
7143226621360461
oct20135631064471
93838466411058
101112101120313
113997040a9877
1215b6484b9275
1380b41b864b1
143bb7c6c8ba1
151dddd0480c8
hex102ee646939

1112101120313 has 2 divisors, whose sum is σ = 1112101120314. Its totient is φ = 1112101120312.

The previous prime is 1112101120199. The next prime is 1112101120349. The reversal of 1112101120313 is 3130211012111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1027682980009 + 84418140304 = 1013747^2 + 290548^2 .

It is a cyclic number.

It is not a de Polignac number, because 1112101120313 - 210 = 1112101119289 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 1112101120291 and 1112101120300.

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

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

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

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

Almost surely, 21112101120313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 36, while the sum is 17.

Adding to 1112101120313 its reverse (3130211012111), we get a palindrome (4242312132424).

The spelling of 1112101120313 in words is "one trillion, one hundred twelve billion, one hundred one million, one hundred twenty thousand, three hundred thirteen".