Search a number
-
+
1122992141 is a prime number
BaseRepresentation
bin100001011101111…
…1000000000001101
32220021002220121112
41002323320000031
54244441222031
6303233341405
736554163365
oct10273700015
92807086545
101122992141
11526999687
12274107865
1314b870cbb
14a92059a5
15688c862b
hex42ef800d

1122992141 has 2 divisors, whose sum is σ = 1122992142. Its totient is φ = 1122992140.

The previous prime is 1122992119. The next prime is 1122992209. The reversal of 1122992141 is 1412992211.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1119170116 + 3822025 = 33454^2 + 1955^2 .

It is a cyclic number.

It is not a de Polignac number, because 1122992141 - 222 = 1118797837 is a prime.

It is a super-2 number, since 2×11229921412 = 2522222697495527762, which contains 22 as substring.

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

It is a congruent number.

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

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

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

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

Almost surely, 21122992141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 2592, while the sum is 32.

The square root of 1122992141 is about 33511.0749006951. The cubic root of 1122992141 is about 1039.4228000906.

The spelling of 1122992141 in words is "one billion, one hundred twenty-two million, nine hundred ninety-two thousand, one hundred forty-one".