Search a number
-
+
12575220069371 is a prime number
BaseRepresentation
bin1011011011111110010110…
…0001100111001111111011
31122112011211201010020220012
42312333211201213033323
53122013022314204441
642424550520252135
72435346450641561
oct266774541471773
948464751106805
1012575220069371
114009136991793
1214b11b391104b
13702ab85a6a3b
14316902c03a31
1516c19c58b9eb
hexb6fe58673fb

12575220069371 has 2 divisors, whose sum is σ = 12575220069372. Its totient is φ = 12575220069370.

The previous prime is 12575220069323. The next prime is 12575220069409. The reversal of 12575220069371 is 17396002257521.

It is a strong prime.

It is an emirp because it is prime and its reverse (17396002257521) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 12575220069371 - 210 = 12575220068347 is a prime.

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

It is a Sophie Germain prime.

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

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

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

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

Almost surely, 212575220069371 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1587600, while the sum is 50.

The spelling of 12575220069371 in words is "twelve trillion, five hundred seventy-five billion, two hundred twenty million, sixty-nine thousand, three hundred seventy-one".