Search a number
-
+
210201101989 is a prime number
BaseRepresentation
bin1100001111000011110…
…1100100011010100101
3202002120021110100200121
43003300331210122211
511420442440230424
6240322015041541
721120656613064
oct3036075443245
9662507410617
10210201101989
11811670510aa
12348a3b102b1
1316a8b88b3b8
14a260c321db
155703d07ee4
hex30f0f646a5

210201101989 has 2 divisors, whose sum is σ = 210201101990. Its totient is φ = 210201101988.

The previous prime is 210201101941. The next prime is 210201102049. The reversal of 210201101989 is 989101102012.

210201101989 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., 205247053764 + 4954048225 = 453042^2 + 70385^2 .

It is a cyclic number.

It is not a de Polignac number, because 210201101989 - 27 = 210201101861 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2210201101989 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2592, while the sum is 34.

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