Search a number
-
+
1057925517589 is a prime number
BaseRepresentation
bin11110110010100010100…
…01100101000100010101
310202010200122111121100101
433121101101211010111
5114313112413030324
62130000531214101
7136301244346033
oct17312121450425
93663618447311
101057925517589
11378733413686
12151049147331
13789ba000835
14392bd5b3553
151c7bbce2944
hexf651465115

1057925517589 has 2 divisors, whose sum is σ = 1057925517590. Its totient is φ = 1057925517588.

The previous prime is 1057925517587. The next prime is 1057925517629. The reversal of 1057925517589 is 9857155297501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 558656089489 + 499269428100 = 747433^2 + 706590^2 .

It is a cyclic number.

It is not a de Polignac number, because 1057925517589 - 21 = 1057925517587 is a prime.

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

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

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

It is a congruent number.

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

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

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

Almost surely, 21057925517589 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1057925517589 in words is "one trillion, fifty-seven billion, nine hundred twenty-five million, five hundred seventeen thousand, five hundred eighty-nine".