Search a number
-
+
1011222002237 is a prime number
BaseRepresentation
bin11101011011100011000…
…01110011101000111101
310120200010210121012112112
432231301201303220331
5113031440313032422
62052314324543405
7133026011124506
oct16556141635075
93520123535475
101011222002237
1135a947504307
12143b94251b65
13744861b2055
1436d2c9c5bad
151b486a58ee2
hexeb71873a3d

1011222002237 has 2 divisors, whose sum is σ = 1011222002238. Its totient is φ = 1011222002236.

The previous prime is 1011222002209. The next prime is 1011222002243. The reversal of 1011222002237 is 7322002221101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 994385901721 + 16836100516 = 997189^2 + 129754^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1011222002237 is a prime.

It is a super-3 number, since 3×10112220022373 (a number of 37 digits) contains 333 as substring.

It is a congruent number.

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

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

Almost surely, 21011222002237 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 672, while the sum is 23.

Adding to 1011222002237 its reverse (7322002221101), we get a palindrome (8333224223338).

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