Search a number
-
+
116656404946937 is a prime number
BaseRepresentation
bin11010100001100100101111…
…100100111101111111111001
3120022001020120102210120120022
4122201210233210331333321
5110242244304131300222
61052035113530540225
733400101315154352
oct3241445744757771
9508036512716508
10116656404946937
1134196781403669
1211100961b97675
135012861c7b3ab
1420b42b3204d29
15d7477a335042
hex6a192f93dff9

116656404946937 has 2 divisors, whose sum is σ = 116656404946938. Its totient is φ = 116656404946936.

The previous prime is 116656404946933. The next prime is 116656404946979. The reversal of 116656404946937 is 739649404656611.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 72102328533481 + 44554076413456 = 8491309^2 + 6674884^2 .

It is a cyclic number.

It is not a de Polignac number, because 116656404946937 - 22 = 116656404946933 is a prime.

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

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

Almost surely, 2116656404946937 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 705438720, while the sum is 71.

The spelling of 116656404946937 in words is "one hundred sixteen trillion, six hundred fifty-six billion, four hundred four million, nine hundred forty-six thousand, nine hundred thirty-seven".