Search a number
-
+
19009512637 is a prime number
BaseRepresentation
bin10001101101000011…
…100010010010111101
31211001210202022000121
4101231003202102331
5302412413401022
612422143454541
71242034122433
oct215503422275
954053668017
1019009512637
118075413225
1238262b7451
131a3c41b53b
14cc4932d53
15763d182c7
hex46d0e24bd

19009512637 has 2 divisors, whose sum is σ = 19009512638. Its totient is φ = 19009512636.

The previous prime is 19009512619. The next prime is 19009512649. The reversal of 19009512637 is 73621590091.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 13139807641 + 5869704996 = 114629^2 + 76614^2 .

It is a cyclic number.

It is not a de Polignac number, because 19009512637 - 227 = 18875294909 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 219009512637 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 102060, while the sum is 43.

The spelling of 19009512637 in words is "nineteen billion, nine million, five hundred twelve thousand, six hundred thirty-seven".