Search a number
-
+
113151103031 is a prime number
BaseRepresentation
bin110100101100001010…
…1001101000000110111
3101211001200202121002202
41221120111031000313
53323213140244111
6123551512455115
711113663335521
oct1513025150067
9354050677082
10113151103031
1143a9493649a
1219b1a0aa49b
13a8932a8405
1456958c0a11
152e23a87b3b
hex1a5854d037

113151103031 has 2 divisors, whose sum is σ = 113151103032. Its totient is φ = 113151103030.

The previous prime is 113151102991. The next prime is 113151103067. The reversal of 113151103031 is 130301151311.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 113151103031 - 210 = 113151102007 is a prime.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 2113151103031 is an apocalyptic number.

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

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

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

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

Adding to 113151103031 its reverse (130301151311), we get a palindrome (243452254342).

The spelling of 113151103031 in words is "one hundred thirteen billion, one hundred fifty-one million, one hundred three thousand, thirty-one".