Search a number
-
+
113150233155551 is a prime number
BaseRepresentation
bin11001101110100011010111…
…011101000001011111011111
3112211122001112022000002201112
4121232203113131001133133
5104312323134141434201
61040352255521132235
732555556154522664
oct3156432735013737
9484561468002645
10113150233155551
1133064820883259
121083533418a07b
134b1a037776177
141dd270155ba6b
15d1346d23e0bb
hex66e8d77417df

113150233155551 has 2 divisors, whose sum is σ = 113150233155552. Its totient is φ = 113150233155550.

The previous prime is 113150233155523. The next prime is 113150233155563. The reversal of 113150233155551 is 155551332051311.

It is a strong prime.

It is a cyclic number.

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

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

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

It is a congruent number.

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

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

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

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

Almost surely, 2113150233155551 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 168750, while the sum is 41.

The spelling of 113150233155551 in words is "one hundred thirteen trillion, one hundred fifty billion, two hundred thirty-three million, one hundred fifty-five thousand, five hundred fifty-one".