Search a number
-
+
111462085194133 is a prime number
BaseRepresentation
bin11001010101111111001001…
…111111100111000110010101
3112121122200010100210012221111
4121111333021333213012111
5104102143322302203013
61033020550335415021
732322604243564522
oct3125771177470625
9477580110705844
10111462085194133
1132573894310783
1210602122984471
134a26aa263b19b
141d74b17d14149
15cd45b81b573d
hex655fc9fe7195

111462085194133 has 2 divisors, whose sum is σ = 111462085194134. Its totient is φ = 111462085194132.

The previous prime is 111462085194113. The next prime is 111462085194167. The reversal of 111462085194133 is 331491580264111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 93799961061444 + 17662124132689 = 9685038^2 + 4202633^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

Almost surely, 2111462085194133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 622080, while the sum is 49.

The spelling of 111462085194133 in words is "one hundred eleven trillion, four hundred sixty-two billion, eighty-five million, one hundred ninety-four thousand, one hundred thirty-three".