Search a number
-
+
11050467257 is a prime number
BaseRepresentation
bin10100100101010100…
…01011111110111001
31001112010101220022002
422102222023332321
5140112404423012
65024305510345
7540561264464
oct122252137671
931463356262
1011050467257
114760778675
1221849423b5
13107151762b
1476b88a2db
1544a20c7c2
hex292a8bfb9

11050467257 has 2 divisors, whose sum is σ = 11050467258. Its totient is φ = 11050467256.

The previous prime is 11050467179. The next prime is 11050467283. The reversal of 11050467257 is 75276405011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11005898281 + 44568976 = 104909^2 + 6676^2 .

It is a cyclic number.

It is not a de Polignac number, because 11050467257 - 216 = 11050401721 is a prime.

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

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

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

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

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

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

Almost surely, 211050467257 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 11050467257 in words is "eleven billion, fifty million, four hundred sixty-seven thousand, two hundred fifty-seven".