Search a number
-
+
118952517353 is a prime number
BaseRepresentation
bin110111011001000011…
…1110101111011101001
3102101001000010222102212
41232302013311323221
53422103321023403
6130351313134505
711410516500065
oct1566207657351
9371030128385
10118952517353
11464a165a98a
121b078b5a435
13b2a9193857
145a86198aa5
1531630454d8
hex1bb21f5ee9

118952517353 has 2 divisors, whose sum is σ = 118952517354. Its totient is φ = 118952517352.

The previous prime is 118952517331. The next prime is 118952517367. The reversal of 118952517353 is 353715259811.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 118723660969 + 228856384 = 344563^2 + 15128^2 .

It is a cyclic number.

It is not a de Polignac number, because 118952517353 - 28 = 118952517097 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 2118952517353 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 1134000, while the sum is 50.

The spelling of 118952517353 in words is "one hundred eighteen billion, nine hundred fifty-two million, five hundred seventeen thousand, three hundred fifty-three".