Search a number
-
+
1040511113 is a prime number
BaseRepresentation
bin111110000001001…
…111000010001001
32200111220102220122
4332001033002021
54112332323423
6251125433025
734533125045
oct7601170211
92614812818
101040511113
11494383444
1225056b775
13137752565
149c295025
15615348c8
hex3e04f089

1040511113 has 2 divisors, whose sum is σ = 1040511114. Its totient is φ = 1040511112.

The previous prime is 1040511107. The next prime is 1040511169. The reversal of 1040511113 is 3111150401.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 639230089 + 401281024 = 25283^2 + 20032^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1040511113 - 210 = 1040510089 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 1040511091 and 1040511100.

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

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

Almost surely, 21040511113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 60, while the sum is 17.

The square root of 1040511113 is about 32256.9544904661. The cubic root of 1040511113 is about 1013.3253506580.

Adding to 1040511113 its reverse (3111150401), we get a palindrome (4151661514).

The spelling of 1040511113 in words is "one billion, forty million, five hundred eleven thousand, one hundred thirteen".