Search a number
-
+
11505000130031 is a prime number
BaseRepresentation
bin1010011101101011011101…
…1100100010010111101111
31111201212102020111022111002
42213122313130202113233
53001444220013130111
640245154000550515
72265131425361402
oct247326734422757
944655366438432
1011505000130031
113736274703081
1213598b532243b
13655bbc447945
142babb8891d39
1514e41126c63b
hexa76b77225ef

11505000130031 has 2 divisors, whose sum is σ = 11505000130032. Its totient is φ = 11505000130030.

The previous prime is 11505000130009. The next prime is 11505000130033. The reversal of 11505000130031 is 13003100050511.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-11505000130031 is a prime.

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

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

It is a Chen prime.

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

It is a congruent number.

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

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

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

Almost surely, 211505000130031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 225, while the sum is 20.

Adding to 11505000130031 its reverse (13003100050511), we get a palindrome (24508100180542).

The spelling of 11505000130031 in words is "eleven trillion, five hundred five billion, one hundred thirty thousand, thirty-one".