Search a number
-
+
1352662013369 is a prime number
BaseRepresentation
bin10011101011110000111…
…100000101010110111001
311210022110100012220200202
4103223300330011112321
5134130222433411434
62513223201211545
7166504140256142
oct23536074052671
94708410186622
101352662013369
1148172a496297
1219a1a3930bb5
139a72b5105b4
144967d660ac9
15252bc349a7e
hex13af0f055b9

1352662013369 has 2 divisors, whose sum is σ = 1352662013370. Its totient is φ = 1352662013368.

The previous prime is 1352662013347. The next prime is 1352662013371. The reversal of 1352662013369 is 9633102662531.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 679285859344 + 673376154025 = 824188^2 + 820595^2 .

It is a cyclic number.

It is not a de Polignac number, because 1352662013369 - 212 = 1352662009273 is a prime.

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

Together with 1352662013371, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

Almost surely, 21352662013369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1049760, while the sum is 47.

The spelling of 1352662013369 in words is "one trillion, three hundred fifty-two billion, six hundred sixty-two million, thirteen thousand, three hundred sixty-nine".