Search a number
-
+
116482859957 is a prime number
BaseRepresentation
bin110110001111011101…
…0110110001110110101
3102010122220001101101102
41230132322312032311
53402024103004312
6125302251535445
711262360654542
oct1543672661665
9363586041342
10116482859957
11454445a0812
121a6a9a5a585
13aca4629309
1458d01a5bc9
15306b30eec2
hex1b1eeb63b5

116482859957 has 2 divisors, whose sum is σ = 116482859958. Its totient is φ = 116482859956.

The previous prime is 116482859953. The next prime is 116482859971. The reversal of 116482859957 is 759958284611.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 116012447236 + 470412721 = 340606^2 + 21689^2 .

It is a cyclic number.

It is not a de Polignac number, because 116482859957 - 22 = 116482859953 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2116482859957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 43545600, while the sum is 65.

The spelling of 116482859957 in words is "one hundred sixteen billion, four hundred eighty-two million, eight hundred fifty-nine thousand, nine hundred fifty-seven".