Search a number
-
+
1112002221037 is a prime number
BaseRepresentation
bin10000001011101000011…
…111110101001111101101
310221022021100100202202211
4100023220133311033231
5121204340032033122
62210502522450421
7143224310631421
oct20135037651755
93838240322684
101112002221037
1139966329a334
1215b61b363a11
1380b27539a06
143bb6d502b81
151ddd450e877
hex102e87f53ed

1112002221037 has 2 divisors, whose sum is σ = 1112002221038. Its totient is φ = 1112002221036.

The previous prime is 1112002221013. The next prime is 1112002221047. The reversal of 1112002221037 is 7301222002111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1109021716201 + 2980504836 = 1053101^2 + 54594^2 .

It is a cyclic number.

It is not a de Polignac number, because 1112002221037 - 219 = 1112001696749 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21112002221037 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 336, while the sum is 22.

Adding to 1112002221037 its reverse (7301222002111), we get a palindrome (8413224223148).

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