Search a number
-
+
15641898157 is a prime number
BaseRepresentation
bin11101001000101010…
…00110110010101101
31111101002222202102101
432210111012302231
5224013311220112
611104044055101
71062422640424
oct164425066255
944332882371
1015641898157
1166a7497666
123046534491
131623824452
14a855962bb
1561835b757
hex3a4546cad

15641898157 has 2 divisors, whose sum is σ = 15641898158. Its totient is φ = 15641898156.

The previous prime is 15641898149. The next prime is 15641898197. The reversal of 15641898157 is 75189814651.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 14398560036 + 1243338121 = 119994^2 + 35261^2 .

It is a cyclic number.

It is not a de Polignac number, because 15641898157 - 23 = 15641898149 is a prime.

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

It is a congruent number.

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

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

Almost surely, 215641898157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 2419200, while the sum is 55.

The spelling of 15641898157 in words is "fifteen billion, six hundred forty-one million, eight hundred ninety-eight thousand, one hundred fifty-seven".