Search a number
-
+
1331689007053 is a prime number
BaseRepresentation
bin10011011000001110110…
…110011010011111001101
311201022022200210210201001
4103120032312122133031
5133304244341211203
62455434113020301
7165132331536136
oct23301666323715
94638280723631
101331689007053
11473847800219
1219610bb54691
139876838a2a2
1448650056c8d
1524990e8091d
hex1360ed9a7cd

1331689007053 has 2 divisors, whose sum is σ = 1331689007054. Its totient is φ = 1331689007052.

The previous prime is 1331689007039. The next prime is 1331689007059. The reversal of 1331689007053 is 3507009861331.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1220907872809 + 110781134244 = 1104947^2 + 332838^2 .

It is a cyclic number.

It is not a de Polignac number, because 1331689007053 - 29 = 1331689006541 is a prime.

It is a super-2 number, since 2×13316890070532 (a number of 25 digits) contains 22 as substring.

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

It is a congruent number.

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

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

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

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

Almost surely, 21331689007053 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 408240, while the sum is 46.

The spelling of 1331689007053 in words is "one trillion, three hundred thirty-one billion, six hundred eighty-nine million, seven thousand, fifty-three".