Search a number
-
+
10202201111989 is a prime number
BaseRepresentation
bin1001010001110110001010…
…0100101011110110110101
31100010022122221022000100001
42110131202210223312311
52314123101441040424
633410454304351301
72102041024421365
oct224354244536665
940108587260301
1010202201111989
113283802614237
121189308615531
135900a94a8213
14273b0969a9a5
1512a5b1753844
hex9476292bdb5

10202201111989 has 2 divisors, whose sum is σ = 10202201111990. Its totient is φ = 10202201111988.

The previous prime is 10202201111957. The next prime is 10202201112029. The reversal of 10202201111989 is 98911110220201.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9801470332900 + 400730779089 = 3130730^2 + 633033^2 .

It is a cyclic number.

It is not a de Polignac number, because 10202201111989 - 25 = 10202201111957 is a prime.

It is a super-2 number, since 2×102022011119892 (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 (10202201111189) 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, 5101100555994 + 5101100555995.

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

Almost surely, 210202201111989 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5184, while the sum is 37.

The spelling of 10202201111989 in words is "ten trillion, two hundred two billion, two hundred one million, one hundred eleven thousand, nine hundred eighty-nine".