Search a number
-
+
1116070957 is a prime number
BaseRepresentation
bin100001010000101…
…1110010000101101
32212210002021112101
41002201132100231
54241203232312
6302425135101
736441306121
oct10241362055
92783067471
101116070957
11522aa16a1
1227192a491
1314a2b9921
14a8323581
1567eaca57
hex4285e42d

1116070957 has 2 divisors, whose sum is σ = 1116070958. Its totient is φ = 1116070956.

The previous prime is 1116070937. The next prime is 1116070973. The reversal of 1116070957 is 7590706111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 801682596 + 314388361 = 28314^2 + 17731^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1116070957 - 219 = 1115546669 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21116070957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13230, while the sum is 37.

The square root of 1116070957 is about 33407.6481812174. The cubic root of 1116070957 is about 1037.2830206141.

The spelling of 1116070957 in words is "one billion, one hundred sixteen million, seventy thousand, nine hundred fifty-seven".