Search a number
-
+
113113176748631 is a prime number
BaseRepresentation
bin11001101110000000110110…
…101110000011001001010111
3112211111111212202211120210222
4121232000312232003021113
5104311221241221424011
61040323250453504555
732553104652334133
oct3156006656031127
9484444782746728
10113113176748631
1133050035469274
121082a11204215b
134b166b04b8777
141dd09c7cb23c3
15d124eeda7ddb
hex66e036b83257

113113176748631 has 2 divisors, whose sum is σ = 113113176748632. Its totient is φ = 113113176748630.

The previous prime is 113113176748571. The next prime is 113113176748643. The reversal of 113113176748631 is 136847671311311.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 113113176748631 - 230 = 113112103006807 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2113113176748631 is an apocalyptic number.

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

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

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

The product of its digits is 1524096, while the sum is 53.

The spelling of 113113176748631 in words is "one hundred thirteen trillion, one hundred thirteen billion, one hundred seventy-six million, seven hundred forty-eight thousand, six hundred thirty-one".