Search a number
-
+
1112151709 is a prime number
BaseRepresentation
bin100001001001010…
…0001011010011101
32212111201011100001
41002102201122131
54234202323314
6302205134301
736363063544
oct10222413235
92774634301
101112151709
11520865049
1227055a391
13149546a46
14a79c315b
1567986674
hex424a169d

1112151709 has 2 divisors, whose sum is σ = 1112151710. Its totient is φ = 1112151708.

The previous prime is 1112151631. The next prime is 1112151721. The reversal of 1112151709 is 9071512111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 895326084 + 216825625 = 29922^2 + 14725^2 .

It is a cyclic number.

It is not a de Polignac number, because 1112151709 - 27 = 1112151581 is a prime.

It is a congruent number.

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

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

Almost surely, 21112151709 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 630, while the sum is 28.

The square root of 1112151709 is about 33348.9386487786. The cubic root of 1112151709 is about 1036.0674057229.

The spelling of 1112151709 in words is "one billion, one hundred twelve million, one hundred fifty-one thousand, seven hundred nine".