Search a number
-
+
1201120211141 is a prime number
BaseRepresentation
bin10001011110101000010…
…101111111000011000101
311020211022010120201202222
4101132220111333003011
5124134343233224031
62315441554342125
7152530610224514
oct21365025770305
94224263521688
101201120211141
11423435056324
1217495088a945
138935a6c3c36
14421c520867b
152139d214e7b
hex117a857f0c5

1201120211141 has 2 divisors, whose sum is σ = 1201120211142. Its totient is φ = 1201120211140.

The previous prime is 1201120211117. The next prime is 1201120211143. The reversal of 1201120211141 is 1411120211021.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1189037584900 + 12082626241 = 1090430^2 + 109921^2 .

It is a cyclic number.

It is not a de Polignac number, because 1201120211141 - 218 = 1201119948997 is a prime.

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

Together with 1201120211143, 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 (1201120211143) by changing a digit.

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

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

Almost surely, 21201120211141 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 1201120211141 its reverse (1411120211021), we get a palindrome (2612240422162).

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