Search a number
-
+
1201110221989 is a prime number
BaseRepresentation
bin10001011110100111101…
…111111000010010100101
311020211021102210020020101
4101132213233320102211
5124134333204100424
62315441000304101
7152530426301566
oct21364757702245
94224242706211
101201110221989
1142342a453327
12174949472031
13893586072b2
14421c3b6816d
152139c3e0344
hex117a7bf84a5

1201110221989 has 2 divisors, whose sum is σ = 1201110221990. Its totient is φ = 1201110221988.

The previous prime is 1201110221963. The next prime is 1201110222061. The reversal of 1201110221989 is 9891220111021.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1200247331364 + 862890625 = 1095558^2 + 29375^2 .

It is a cyclic number.

It is not a de Polignac number, because 1201110221989 - 221 = 1201108124837 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21201110221989 is an apocalyptic number.

It is an amenable number.

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

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

1201110221989 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 1201110221989 in words is "one trillion, two hundred one billion, one hundred ten million, two hundred twenty-one thousand, nine hundred eighty-nine".