Search a number
-
+
119596177069 is a prime number
BaseRepresentation
bin110111101100001111…
…1001101011010101101
3102102200212022021120121
41233120133031122231
53424413110131234
6130535225044541
711432463506035
oct1573037153255
9372625267517
10119596177069
11467a1a18a66
121b218626751
13b37c6379a5
145b078688c5
15319e7d94b4
hex1bd87cd6ad

119596177069 has 2 divisors, whose sum is σ = 119596177070. Its totient is φ = 119596177068.

The previous prime is 119596177037. The next prime is 119596177073. The reversal of 119596177069 is 960771695911.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 89036592100 + 30559584969 = 298390^2 + 174813^2 .

It is a cyclic number.

It is not a de Polignac number, because 119596177069 - 25 = 119596177037 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 2119596177069 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6429780, while the sum is 61.

The spelling of 119596177069 in words is "one hundred nineteen billion, five hundred ninety-six million, one hundred seventy-seven thousand, sixty-nine".