Search a number
-
+
118941196721 is a prime number
BaseRepresentation
bin110111011000101110…
…0101010000110110001
3102101000012211211110012
41232301130222012301
53422042421243341
6130350230344305
711410321330244
oct1566134520661
9371005754405
10118941196721
1146496228596
121b0751bb095
13b2a6a2bb59
145a8488d25b
15316205b0eb
hex1bb172a1b1

118941196721 has 2 divisors, whose sum is σ = 118941196722. Its totient is φ = 118941196720.

The previous prime is 118941196709. The next prime is 118941196723. The reversal of 118941196721 is 127691149811.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 72503101696 + 46438095025 = 269264^2 + 215495^2 .

It is a cyclic number.

It is not a de Polignac number, because 118941196721 - 26 = 118941196657 is a prime.

Together with 118941196723, it forms a pair of twin primes.

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 118941196721.

It is not a weakly prime, because it can be changed into another prime (118941196723) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 59470598360 + 59470598361.

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

Almost surely, 2118941196721 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 118941196721 in words is "one hundred eighteen billion, nine hundred forty-one million, one hundred ninety-six thousand, seven hundred twenty-one".