Search a number
-
+
2022022222037 is a prime number
BaseRepresentation
bin11101011011001001111…
…010101001000011010101
321011022012012112122100022
4131123021322221003111
5231112100142101122
64144523145354525
7266041411206026
oct35331172510325
97138165478308
102022022222037
1170a597915194
12287a6b198a45
131188a2b96c9c
146dc1b576c4d
15378e654a642
hex1d6c9ea90d5

2022022222037 has 2 divisors, whose sum is σ = 2022022222038. Its totient is φ = 2022022222036.

The previous prime is 2022022221953. The next prime is 2022022222057. The reversal of 2022022222037 is 7302222202202.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1948910929156 + 73111292881 = 1396034^2 + 270391^2 .

It is a cyclic number.

It is not a de Polignac number, because 2022022222037 - 236 = 1953302745301 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 22022022222037 is an apocalyptic number.

It is an amenable number.

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

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

2022022222037 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 5376, while the sum is 26.

Adding to 2022022222037 its reverse (7302222202202), we get a palindrome (9324244424239).

The spelling of 2022022222037 in words is "two trillion, twenty-two billion, twenty-two million, two hundred twenty-two thousand, thirty-seven".