Search a number
-
+
200121111201281 is a prime number
BaseRepresentation
bin101101100000001001010011…
…101111101100011000000001
3222020120101120022201112122212
4231200021103233230120001
5202212241013431420111
61545342211434511505
760103162456455014
oct5540112357543001
9866511508645585
10200121111201281
1158845983143436
121a54098b295595
1387884557494aa
14375bcb078337b
15182092188e98b
hexb60253bec601

200121111201281 has 2 divisors, whose sum is σ = 200121111201282. Its totient is φ = 200121111201280.

The previous prime is 200121111201247. The next prime is 200121111201287. The reversal of 200121111201281 is 182102111121002.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 143875011133681 + 56246100067600 = 11994791^2 + 7499740^2 .

It is a cyclic number.

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

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

It is not a weakly prime, because it can be changed into another prime (200121111201287) by changing a digit.

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

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

Almost surely, 2200121111201281 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 128, while the sum is 23.

Adding to 200121111201281 its reverse (182102111121002), we get a palindrome (382223222322283).

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