Search a number
-
+
15625130639 is a prime number
BaseRepresentation
bin11101000110101010…
…01001001010001111
31111022221102212201012
432203111021022033
5224000013140024
611102244435435
71062130263506
oct164325111217
944287385635
1015625130639
116698a84a08
1230409a8b7b
131620203441
14a8326d83d
15616b4850e
hex3a354928f

15625130639 has 2 divisors, whose sum is σ = 15625130640. Its totient is φ = 15625130638.

The previous prime is 15625130621. The next prime is 15625130641. The reversal of 15625130639 is 93603152651.

15625130639 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 15625130639 - 28 = 15625130383 is a prime.

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 15625130596 and 15625130605.

It is a congruent number.

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

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

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

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

Almost surely, 215625130639 is an apocalyptic number.

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

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

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

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

The spelling of 15625130639 in words is "fifteen billion, six hundred twenty-five million, one hundred thirty thousand, six hundred thirty-nine".