Search a number
-
+
119404451065751 is a prime number
BaseRepresentation
bin11011001001100100000011…
…111000111110111110010111
3120122202221202111101112210022
4123021210003320332332113
5111122310303433101001
61101541351512215355
734102454415601205
oct3311440370767627
9518687674345708
10119404451065751
1135056163839255
121148547109a55b
135181a399a19a7
14216b2c5dd8075
15dc0eb545c11b
hex6c9903e3ef97

119404451065751 has 2 divisors, whose sum is σ = 119404451065752. Its totient is φ = 119404451065750.

The previous prime is 119404451065741. The next prime is 119404451065763. The reversal of 119404451065751 is 157560154404911.

It is a happy number.

It is a weak prime.

It is an emirp because it is prime and its reverse (157560154404911) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 119404451065751 - 230 = 119403377323927 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2119404451065751 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3024000, while the sum is 53.

The spelling of 119404451065751 in words is "one hundred nineteen trillion, four hundred four billion, four hundred fifty-one million, sixty-five thousand, seven hundred fifty-one".