Search a number
-
+
1116156713 = 7499319541
BaseRepresentation
bin100001010000111…
…0011001100101001
32212210020122011112
41002201303030221
54241214003323
6302431040105
736442114130
oct10241631451
92783218145
101116156713
11523050071
12271970035
1314a319979
14a8346917
1567ec8178
hex42873329

1116156713 has 8 divisors (see below), whose sum is σ = 1278168000. Its totient is φ = 954785520.

The previous prime is 1116156703. The next prime is 1116156737. The reversal of 1116156713 is 3176516111.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 1116156713 - 26 = 1116156649 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 1116156713.

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

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

Almost surely, 21116156713 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 320047.

The product of its digits is 3780, while the sum is 32.

The square root of 1116156713 is about 33408.9316351182. The cubic root of 1116156713 is about 1037.3095873133.

The spelling of 1116156713 in words is "one billion, one hundred sixteen million, one hundred fifty-six thousand, seven hundred thirteen".

Divisors: 1 7 499 3493 319541 2236787 159450959 1116156713