Search a number
-
+
116674155442147 is a prime number
BaseRepresentation
bin11010100001110101010001…
…100101101110111111100011
3120022002221101111111011100211
4122201311101211232333203
5110243042132243122042
61052051211141354551
733401300223656302
oct3241652145567743
9508087344434324
10116674155442147
11341a3260070416
1211104296708a57
1350144305b07b4
1420b50b8844439
15d74e68856017
hex6a1d5196efe3

116674155442147 has 2 divisors, whose sum is σ = 116674155442148. Its totient is φ = 116674155442146.

The previous prime is 116674155442087. The next prime is 116674155442151. The reversal of 116674155442147 is 741244551476611.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 116674155442147 - 211 = 116674155440099 is a prime.

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

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

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

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

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

Almost surely, 2116674155442147 is an apocalyptic number.

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

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

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

The product of its digits is 22579200, while the sum is 58.

The spelling of 116674155442147 in words is "one hundred sixteen trillion, six hundred seventy-four billion, one hundred fifty-five million, four hundred forty-two thousand, one hundred forty-seven".