Search a number
-
+
1113826937 is a prime number
BaseRepresentation
bin100001001100011…
…1010011001111001
32212121212021022112
41002120322121321
54240114430222
6302305102105
736413241566
oct10230723171
92777767275
101113826937
115217a9733
12271027935
131499b23c2
14a7cdb86d
1567bb7be2
hex4263a679

1113826937 has 2 divisors, whose sum is σ = 1113826938. Its totient is φ = 1113826936.

The previous prime is 1113826933. The next prime is 1113826939. The reversal of 1113826937 is 7396283111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1097994496 + 15832441 = 33136^2 + 3979^2 .

It is a cyclic number.

It is not a de Polignac number, because 1113826937 - 22 = 1113826933 is a prime.

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

Together with 1113826939, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

Almost surely, 21113826937 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 54432, while the sum is 41.

The square root of 1113826937 is about 33374.0458590204. The cubic root of 1113826937 is about 1036.5873522902.

The spelling of 1113826937 in words is "one billion, one hundred thirteen million, eight hundred twenty-six thousand, nine hundred thirty-seven".