Search a number
-
+
22003220053 is a prime number
BaseRepresentation
bin10100011111011111…
…100111111001010101
32002210102221101120001
4110133133213321111
5330030311020203
614035205211301
71406155166413
oct243737477125
962712841501
1022003220053
119371275991
124320a00b31
1320c870b849
1410ca37c2b3
1588ba6791d
hex51f7e7e55

22003220053 has 2 divisors, whose sum is σ = 22003220054. Its totient is φ = 22003220052.

The previous prime is 22003219991. The next prime is 22003220077. The reversal of 22003220053 is 35002230022.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 13582037764 + 8421182289 = 116542^2 + 91767^2 .

It is a cyclic number.

It is not a de Polignac number, because 22003220053 - 221 = 22001122901 is a prime.

It is a super-4 number, since 4×220032200534 (a number of 42 digits) contains 4444 as substring.

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

It is a congruent number.

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

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

Almost surely, 222003220053 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 22003220053 its reverse (35002230022), we get a palindrome (57005450075).

The spelling of 22003220053 in words is "twenty-two billion, three million, two hundred twenty thousand, fifty-three".