Search a number
-
+
11060501059 is a prime number
BaseRepresentation
bin10100100110100000…
…11101101001000011
31001112211021200002101
422103100131221003
5140122442013214
65025304531231
7541042464526
oct122320355103
931484250071
1011060501059
114766401173
122188180b17
13107361b6aa
1476cd3cbbd
1544b040774
hex29341da43

11060501059 has 2 divisors, whose sum is σ = 11060501060. Its totient is φ = 11060501058.

The previous prime is 11060500931. The next prime is 11060501071. The reversal of 11060501059 is 95010506011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11060501059 - 27 = 11060500931 is a prime.

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

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

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

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

Almost surely, 211060501059 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1350, while the sum is 28.

The spelling of 11060501059 in words is "eleven billion, sixty million, five hundred one thousand, fifty-nine".