1011116947 has 2 divisors, whose sum is σ = 1011116948. Its totient is φ = 1011116946.

The previous prime is 1011116917. The next prime is 1011116957. The reversal of 1011116947 is 7496111101.

1011116947 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

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

It is a cyclic number.

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

It is not a weakly prime, because it can be changed into another prime (1011116917) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505558473 + 505558474.

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

Almost surely, 2^1011116947 is an apocalyptic number.

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

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

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

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

The square root of 1011116947 is about 31798.0651455399. The cubic root of 1011116947 is about 1003.6920013510.

The spelling of 1011116947 in words is "one billion, eleven million, one hundred sixteen thousand, nine hundred forty-seven".