Search a number
-
+
6158425589 is a prime number
BaseRepresentation
bin1011011110001001…
…00001110111110101
3120220012011102201122
411233010201313311
5100103024104324
62455032233325
7305416516361
oct55704416765
916805142648
106158425589
1126802a8328
12123a53b845
13771b57a14
14425c8c2a1
152609cda5e
hex16f121df5

6158425589 has 2 divisors, whose sum is σ = 6158425590. Its totient is φ = 6158425588.

The previous prime is 6158425583. The next prime is 6158425591. The reversal of 6158425589 is 9855248516.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5661358564 + 497067025 = 75242^2 + 22295^2 .

It is a cyclic number.

It is not a de Polignac number, because 6158425589 - 24 = 6158425573 is a prime.

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

It is a Chen prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (6158425583) 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, 3079212794 + 3079212795.

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

Almost surely, 26158425589 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 3456000, while the sum is 53.

The square root of 6158425589 is about 78475.6369136307. The cubic root of 6158425589 is about 1832.9751032044.

The spelling of 6158425589 in words is "six billion, one hundred fifty-eight million, four hundred twenty-five thousand, five hundred eighty-nine".