Search a number
-
+
119503299709 is a prime number
BaseRepresentation
bin110111101001011110…
…0111010010001111101
3102102110101112121210101
41233102330322101331
53424220321042314
6130522110241101
711430255200413
oct1572274722175
9372411477711
10119503299709
1146754551912
121b1b14b6191
13b366319181
145ad93ad2b3
153196590174
hex1bd2f3a47d

119503299709 has 2 divisors, whose sum is σ = 119503299710. Its totient is φ = 119503299708.

The previous prime is 119503299701. The next prime is 119503299809. The reversal of 119503299709 is 907992305911.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 100584122500 + 18919177209 = 317150^2 + 137547^2 .

It is a cyclic number.

It is not a de Polignac number, because 119503299709 - 23 = 119503299701 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2119503299709 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1377810, while the sum is 55.

The spelling of 119503299709 in words is "one hundred nineteen billion, five hundred three million, two hundred ninety-nine thousand, seven hundred nine".