11015650147 has 2 divisors, whose sum is σ = 11015650148. Its totient is φ = 11015650146.

The previous prime is 11015650117. The next prime is 11015650171. The reversal of 11015650147 is 74105651011.

11015650147 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 a cyclic number.

It is not a de Polignac number, because 11015650147 - 2¹¹ = 11015648099 is a prime.

It is a super-2 number, since 2×11015650147² (a number of 21 digits) contains 22 as substring.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2^11015650147 is an apocalyptic number.

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

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

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

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

The spelling of 11015650147 in words is "eleven billion, fifteen million, six hundred fifty thousand, one hundred forty-seven".