Search a number
-
+
119006137036909 is a prime number
BaseRepresentation
bin11011000011110001000110…
…100001100011000001101101
3120121100212122022021101102201
4123003301012201203001231
5111044244032040140114
61101034355320221501
734031624005323043
oct3303610641430155
9517325568241381
10119006137036909
1134a12245967a51
121142022a60a891
1351532cc73a625
142155cdbb08393
15db5951a95874
hex6c3c4686306d

119006137036909 has 2 divisors, whose sum is σ = 119006137036910. Its totient is φ = 119006137036908.

The previous prime is 119006137036859. The next prime is 119006137036931. The reversal of 119006137036909 is 909630731600911.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 110454782004009 + 8551355032900 = 10509747^2 + 2924270^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-119006137036909 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2119006137036909 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 119006137036909 in words is "one hundred nineteen trillion, six billion, one hundred thirty-seven million, thirty-six thousand, nine hundred nine".