Search a number
-
+
116750450057 is a prime number
BaseRepresentation
bin110110010111011011…
…1100111110110001001
3102011100112120100222212
41230232313213312021
53403101103400212
6125345011154505
711302120310603
oct1545667476611
9364315510885
10116750450057
114557164915a
121a7635a5a35
13b017bba257
145917940173
153084a6ae22
hex1b2ede7d89

116750450057 has 2 divisors, whose sum is σ = 116750450058. Its totient is φ = 116750450056.

The previous prime is 116750450041. The next prime is 116750450101. The reversal of 116750450057 is 750054057611.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 90977037376 + 25773412681 = 301624^2 + 160541^2 .

It is a cyclic number.

It is not a de Polignac number, because 116750450057 - 24 = 116750450041 is a prime.

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

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

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

Almost surely, 2116750450057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 147000, while the sum is 41.

The spelling of 116750450057 in words is "one hundred sixteen billion, seven hundred fifty million, four hundred fifty thousand, fifty-seven".