Search a number
-
+
11166353057 is a prime number
BaseRepresentation
bin10100110011001000…
…10000011010100001
31001211012110111201202
422121210100122201
5140332041244212
65044005410545
7543466302116
oct123144203241
931735414652
1011166353057
11481012a362
1221b7709a55
13108c530a02
1477d01490d
1545549e0c2
hex2999106a1

11166353057 has 2 divisors, whose sum is σ = 11166353058. Its totient is φ = 11166353056.

The previous prime is 11166353021. The next prime is 11166353059. The reversal of 11166353057 is 75035366111.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10535790736 + 630562321 = 102644^2 + 25111^2 .

It is a cyclic number.

It is not a de Polignac number, because 11166353057 - 218 = 11166090913 is a prime.

Together with 11166353059, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

Almost surely, 211166353057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 56700, while the sum is 38.

The spelling of 11166353057 in words is "eleven billion, one hundred sixty-six million, three hundred fifty-three thousand, fifty-seven".