Search a number
-
+
1111191361157 is a prime number
BaseRepresentation
bin10000001010111000001…
…010101001011010000101
310221020011211120211010102
4100022320022221122011
5121201204442024112
62210250235133445
7143165233504433
oct20127012513205
93836154524112
101111191361157
113992876112a9
1215b4338a4285
1380a28553a77
143bad394bd53
151dd8823ebc2
hex102b82a9685

1111191361157 has 2 divisors, whose sum is σ = 1111191361158. Its totient is φ = 1111191361156.

The previous prime is 1111191361153. The next prime is 1111191361289. The reversal of 1111191361157 is 7511631911111.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1089871272961 + 21320088196 = 1043969^2 + 146014^2 .

It is a cyclic number.

It is not a de Polignac number, because 1111191361157 - 22 = 1111191361153 is a prime.

It is a super-2 number, since 2×11111913611572 (a number of 25 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 1111191361157.

It is a congruent number.

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

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

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

Almost surely, 21111191361157 is an apocalyptic number.

It is an amenable number.

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

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

1111191361157 is an evil number, because the sum of its binary digits is even.

The product of its digits is 5670, while the sum is 38.

The spelling of 1111191361157 in words is "one trillion, one hundred eleven billion, one hundred ninety-one million, three hundred sixty-one thousand, one hundred fifty-seven".