Search a number
-
+
118908433506097 is a prime number
BaseRepresentation
bin11011000010010110000110…
…111100001001111100110001
3120121000112110011211202200101
4123002112012330021330301
5111041143432434143342
61100521440310352401
734021564555112014
oct3302260674117461
9517015404752611
10118908433506097
1134984868861174
121140530195b701
13514702b937bc1
1421512ada7737b
15db31342813b7
hex6c2586f09f31

118908433506097 has 2 divisors, whose sum is σ = 118908433506098. Its totient is φ = 118908433506096.

The previous prime is 118908433506091. The next prime is 118908433506113. The reversal of 118908433506097 is 790605334809811.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 101918736621361 + 16989696884736 = 10095481^2 + 4121856^2 .

It is a cyclic number.

It is not a de Polignac number, because 118908433506097 - 23 = 118908433506089 is a prime.

It is a super-3 number, since 3×1189084335060973 (a number of 43 digits) contains 333 as substring.

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

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

Almost surely, 2118908433506097 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 39191040, while the sum is 64.

The spelling of 118908433506097 in words is "one hundred eighteen trillion, nine hundred eight billion, four hundred thirty-three million, five hundred six thousand, ninety-seven".