Search a number
-
+
1971500527013 is a prime number
BaseRepresentation
bin11100101100000110100…
…101101010110110100101
320222110210021001121200112
4130230012211222312211
5224300113113331023
64105410030222405
7262302422660363
oct34540645526645
96873707047615
101971500527013
116a0121717a26
1227a10b654a05
13113bb10173a4
146b5c7844633
153643aea4478
hex1cb0696ada5

1971500527013 has 2 divisors, whose sum is σ = 1971500527014. Its totient is φ = 1971500527012.

The previous prime is 1971500526977. The next prime is 1971500527021. The reversal of 1971500527013 is 3107250051791.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1672901667649 + 298598859364 = 1293407^2 + 546442^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1971500527013 - 210 = 1971500525989 is a prime.

It is a congruent number.

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

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

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

Almost surely, 21971500527013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1971500527013 in words is "one trillion, nine hundred seventy-one billion, five hundred million, five hundred twenty-seven thousand, thirteen".