Search a number
-
+
1022220021113 is a prime number
BaseRepresentation
bin11101110000000010000…
…11111010110101111001
310121201112021022110011222
432320001003322311321
5113222001311133423
62101333522401425
7133565364546464
oct16700103726571
93551467273158
101022220021113
11364580609705
12146143500275
1375519894a25
14376934dc2db
151b8cc3563c8
hexee010fad79

1022220021113 has 2 divisors, whose sum is σ = 1022220021114. Its totient is φ = 1022220021112.

The previous prime is 1022220021107. The next prime is 1022220021131. The reversal of 1022220021113 is 3111200222201.

Together with next prime (1022220021131) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 702693239824 + 319526781289 = 838268^2 + 565267^2 .

It is a cyclic number.

It is not a de Polignac number, because 1022220021113 - 216 = 1022219955577 is a prime.

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

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

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

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

Almost surely, 21022220021113 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 1022220021113 its reverse (3111200222201), we get a palindrome (4133420243314).

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