Search a number
-
+
1002022110253 is a prime number
BaseRepresentation
bin11101001010011010010…
…11000000010000101101
310112210101122101021021101
432211031023000100231
5112404120130012003
62044153403203101
7132252020256133
oct16451513002055
93483348337241
101002022110253
11356a563a429a
12142247216491
137364b1b4998
14366d8c19753
151b0e904511d
hexe94d2c042d

1002022110253 has 2 divisors, whose sum is σ = 1002022110254. Its totient is φ = 1002022110252.

The previous prime is 1002022110209. The next prime is 1002022110301. The reversal of 1002022110253 is 3520112202001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 597835147204 + 404186963049 = 773198^2 + 635757^2 .

It is a cyclic number.

It is not a de Polignac number, because 1002022110253 - 29 = 1002022109741 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1002022110253.

It is a congruent number.

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

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

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

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

Almost surely, 21002022110253 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 240, while the sum is 19.

Adding to 1002022110253 its reverse (3520112202001), we get a palindrome (4522134312254).

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