Search a number
-
+
1220221001141 is a prime number
BaseRepresentation
bin10001110000011010110…
…101101101110110110101
311022122121022002101210122
4101300122311231312311
5124443003034014031
62332321202501325
7154105133243102
oct21603265556665
94278538071718
101220221001141
11430546a4258a
121785a1664845
138b0b29c093c
14430b7cdbaa9
1521b1a05d47b
hex11c1ad6ddb5

1220221001141 has 2 divisors, whose sum is σ = 1220221001142. Its totient is φ = 1220221001140.

The previous prime is 1220221001123. The next prime is 1220221001143. The reversal of 1220221001141 is 1411001220221.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1128808502116 + 91412499025 = 1062454^2 + 302345^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1220221001141 is a prime.

Together with 1220221001143, 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 (1220221001143) 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, 610110500570 + 610110500571.

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

Almost surely, 21220221001141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 64, while the sum is 17.

Adding to 1220221001141 its reverse (1411001220221), we get a palindrome (2631222221362).

The spelling of 1220221001141 in words is "one trillion, two hundred twenty billion, two hundred twenty-one million, one thousand, one hundred forty-one".