Search a number
-
+
1580137864489 is a prime number
BaseRepresentation
bin10110111111100111100…
…011100101110100101001
312121001121112011110020201
4112333213203211310221
5201342110243130424
63205523314152201
7222106201144312
oct26774743456451
95531545143221
101580137864489
1155a1506a3068
122162a8b82661
13b6010c8b732
145669c851609
152b1829ebd44
hex16fe78e5d29

1580137864489 has 2 divisors, whose sum is σ = 1580137864490. Its totient is φ = 1580137864488.

The previous prime is 1580137864457. The next prime is 1580137864531. The reversal of 1580137864489 is 9844687310851.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1575012450025 + 5125414464 = 1254995^2 + 71592^2 .

It is a cyclic number.

It is not a de Polignac number, because 1580137864489 - 25 = 1580137864457 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 1580137864489.

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

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

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

Almost surely, 21580137864489 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 46448640, while the sum is 64.

The spelling of 1580137864489 in words is "one trillion, five hundred eighty billion, one hundred thirty-seven million, eight hundred sixty-four thousand, four hundred eighty-nine".