Search a number
-
+
1116915601 = 8271350563
BaseRepresentation
bin100001010010010…
…1100011110010001
32212211200012011111
41002210230132101
54241412244401
6302455213321
736451424464
oct10244543621
92784605144
101116915601
1152351924a
12272077241
1314a524209
14a84a32db
15680c7e51
hex4292c791

1116915601 has 4 divisors (see below), whose sum is σ = 1118266992. Its totient is φ = 1115564212.

The previous prime is 1116915533. The next prime is 1116915643. The reversal of 1116915601 is 1065196111.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 1065196111 = 7152170873.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1116915601 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (1116915001) 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 in 3 ways as a sum of consecutive naturals, for example, 674455 + ... + 676108.

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

Almost surely, 21116915601 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1351390.

The product of its (nonzero) digits is 1620, while the sum is 31.

The square root of 1116915601 is about 33420.2872668683. The cubic root of 1116915601 is about 1037.5446270251.

The spelling of 1116915601 in words is "one billion, one hundred sixteen million, nine hundred fifteen thousand, six hundred one".

Divisors: 1 827 1350563 1116915601