Search a number
-
+
1210202022121 is a prime number
BaseRepresentation
bin10001100111000101101…
…010010110000011101001
311021200202001121112100121
4101213011222112003221
5124311443204201441
62323543101203241
7153301635313531
oct21470552260351
94250661545317
101210202022121
11427275545334
12176666260521
138a1770b99a1
14428074384c1
15217306a1dd1
hex119c5a960e9

1210202022121 has 2 divisors, whose sum is σ = 1210202022122. Its totient is φ = 1210202022120.

The previous prime is 1210202022109. The next prime is 1210202022143. The reversal of 1210202022121 is 1212202020121.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 680889025600 + 529312996521 = 825160^2 + 727539^2 .

It is a cyclic number.

It is not a de Polignac number, because 1210202022121 - 25 = 1210202022089 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 21210202022121 is an apocalyptic number.

It is an amenable number.

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

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

1210202022121 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 16.

Adding to 1210202022121 its reverse (1212202020121), we get a palindrome (2422404042242).

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