Search a number
-
+
1126732693 is a prime number
BaseRepresentation
bin100001100101000…
…1001001110010101
32220112010221200111
41003022021032111
54301420421233
6303445443021
736631032652
oct10312111625
92815127614
101126732693
11529013a49
12275410471
1314c580748
14a98dac29
1568db6acd
hex43289395

1126732693 has 2 divisors, whose sum is σ = 1126732694. Its totient is φ = 1126732692.

The previous prime is 1126732667. The next prime is 1126732709. The reversal of 1126732693 is 3962376211.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1099452964 + 27279729 = 33158^2 + 5223^2 .

It is an emirp because it is prime and its reverse (3962376211) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1126732693 - 29 = 1126732181 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21126732693 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 81648, while the sum is 40.

The square root of 1126732693 is about 33566.8391869118. The cubic root of 1126732693 is about 1040.5755852928.

The spelling of 1126732693 in words is "one billion, one hundred twenty-six million, seven hundred thirty-two thousand, six hundred ninety-three".