Search a number
-
+
1022201133169 is a prime number
BaseRepresentation
bin11101101111111111110…
…11110111100001110001
310121201110221202211210111
432313333323313201301
5113221431442230134
62101332005501321
7133565045161546
oct16677773674161
93551427684714
101022201133169
11364570988937
12146139111841
13755159b0828
1437690bc2bcd
151b8ca874c64
hexedffef7871

1022201133169 has 2 divisors, whose sum is σ = 1022201133170. Its totient is φ = 1022201133168.

The previous prime is 1022201133119. The next prime is 1022201133209. The reversal of 1022201133169 is 9613311022201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 560270214144 + 461930919025 = 748512^2 + 679655^2 .

It is a cyclic number.

It is not a de Polignac number, because 1022201133169 - 211 = 1022201131121 is a prime.

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

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

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

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

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

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

Almost surely, 21022201133169 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3888, while the sum is 31.

The spelling of 1022201133169 in words is "one trillion, twenty-two billion, two hundred one million, one hundred thirty-three thousand, one hundred sixty-nine".