Search a number
-
+
2000110110121 is a prime number
BaseRepresentation
bin11101000110101111110…
…110100100010110101001
321002012122010001000122201
4131012233312210112221
5230232211142010441
64130500553020201
7264334410265564
oct35065766442651
97065563030581
102000110110121
11701273018192
122837749b4661
131167c03078a6
146cb3d3534db
15370629ccc31
hex1d1afda45a9

2000110110121 has 2 divisors, whose sum is σ = 2000110110122. Its totient is φ = 2000110110120.

The previous prime is 2000110110077. The next prime is 2000110110133. The reversal of 2000110110121 is 1210110110002.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1067657225625 + 932452884496 = 1033275^2 + 965636^2 .

It is a cyclic number.

It is not a de Polignac number, because 2000110110121 - 239 = 1450354296233 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 2000110110098 and 2000110110107.

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

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

Almost surely, 22000110110121 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4, while the sum is 10.

Adding to 2000110110121 its reverse (1210110110002), we get a palindrome (3210220220123).

The spelling of 2000110110121 in words is "two trillion, one hundred ten million, one hundred ten thousand, one hundred twenty-one".