Search a number
-
+
1369200331157 is a prime number
BaseRepresentation
bin10011111011001010101…
…100110000100110010101
311211220010220222111200012
4103323022230300212111
5134413110241044112
62525000230530005
7200631026534111
oct23731254604625
94756126874605
101369200331157
1148874698a21a
121a143a506905
139c165976859
144a3abcc0741
1525939227022
hex13ecab30995

1369200331157 has 2 divisors, whose sum is σ = 1369200331158. Its totient is φ = 1369200331156.

The previous prime is 1369200331049. The next prime is 1369200331207. The reversal of 1369200331157 is 7511330029631.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 746152167601 + 623048163556 = 863801^2 + 789334^2 .

It is a cyclic number.

It is not a de Polignac number, because 1369200331157 - 226 = 1369133222293 is a prime.

It is a super-3 number, since 3×13692003311573 (a number of 37 digits) contains 333 as substring.

It is a congruent number.

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

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

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

Almost surely, 21369200331157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 102060, while the sum is 41.

The spelling of 1369200331157 in words is "one trillion, three hundred sixty-nine billion, two hundred million, three hundred thirty-one thousand, one hundred fifty-seven".