Search a number
-
+
9897532637 is a prime number
BaseRepresentation
bin10010011011111000…
…00101110011011101
3221112202221202022212
421031330011303131
5130232232021022
64314042250205
7500161432166
oct111574056335
927482852285
109897532637
114219998843
121b027b6965
13c196c18b5
1469c6cc76d
153cddbc3e2
hex24df05cdd

9897532637 has 2 divisors, whose sum is σ = 9897532638. Its totient is φ = 9897532636.

The previous prime is 9897532487. The next prime is 9897532639. The reversal of 9897532637 is 7362357989.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9836474041 + 61058596 = 99179^2 + 7814^2 .

It is a cyclic number.

It is not a de Polignac number, because 9897532637 - 220 = 9896484061 is a prime.

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

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

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 29897532637 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 17146080, while the sum is 59.

The square root of 9897532637 is about 99486.3439724267. The cubic root of 9897532637 is about 2147.0507705677.

The spelling of 9897532637 in words is "nine billion, eight hundred ninety-seven million, five hundred thirty-two thousand, six hundred thirty-seven".