Search a number
-
+
9489605703037 is a prime number
BaseRepresentation
bin1000101000010111100010…
…0100111011010101111101
31020121012022221022112201021
42022011320210323111331
52220434203024444122
632103244211544141
71666413163403065
oct212057044732575
936535287275637
109489605703037
113029579031459
1210931958bb051
1353ab34727795
1424b4296683a5
15116ca6a181c7
hex8a17893b57d

9489605703037 has 2 divisors, whose sum is σ = 9489605703038. Its totient is φ = 9489605703036.

The previous prime is 9489605703029. The next prime is 9489605703091. The reversal of 9489605703037 is 7303075069849.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 8956726142841 + 532879560196 = 2992779^2 + 729986^2 .

It is a cyclic number.

It is not a de Polignac number, because 9489605703037 - 23 = 9489605703029 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 29489605703037 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 34292160, while the sum is 61.

The spelling of 9489605703037 in words is "nine trillion, four hundred eighty-nine billion, six hundred five million, seven hundred three thousand, thirty-seven".