Search a number
-
+
1371472013581 is a prime number
BaseRepresentation
bin10011111101010010000…
…110100010100100001101
311212010000020112221010021
4103331102012202210031
5134432233313413311
62530013500542141
7201041232524665
oct23752206424415
94763006487107
101371472013581
1148970221990a
121a1973251951
139c4384b5737
144a54589b1a5
1525a1d8a3171
hex13f521a290d

1371472013581 has 2 divisors, whose sum is σ = 1371472013582. Its totient is φ = 1371472013580.

The previous prime is 1371472013519. The next prime is 1371472013599. The reversal of 1371472013581 is 1853102741731.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1369005302025 + 2466711556 = 1170045^2 + 49666^2 .

It is a cyclic number.

It is not a de Polignac number, because 1371472013581 - 213 = 1371472005389 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 21371472013581 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 141120, while the sum is 43.

The spelling of 1371472013581 in words is "one trillion, three hundred seventy-one billion, four hundred seventy-two million, thirteen thousand, five hundred eighty-one".