Search a number
-
+
1076887113157 is a prime number
BaseRepresentation
bin11111010101110110111…
…10010100110111000101
310210221122010002110111201
433222323132110313011
5120120431100110112
62142414244102501
7140542160300542
oct17527336246705
93727563073451
101076887113157
11385783779019
1215485b394a31
137a71c512a7b
143a19b9d1bc9
151d02b7e3257
hexfabb794dc5

1076887113157 has 2 divisors, whose sum is σ = 1076887113158. Its totient is φ = 1076887113156.

The previous prime is 1076887113131. The next prime is 1076887113167. The reversal of 1076887113157 is 7513117886701.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 714499968961 + 362387144196 = 845281^2 + 601986^2 .

It is a cyclic number.

It is not a de Polignac number, because 1076887113157 - 215 = 1076887080389 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 21076887113157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1975680, while the sum is 55.

The spelling of 1076887113157 in words is "one trillion, seventy-six billion, eight hundred eighty-seven million, one hundred thirteen thousand, one hundred fifty-seven".