Search a number
-
+
120130119937 is a prime number
BaseRepresentation
bin110111111100001010…
…0000010100100000001
3102111002002000101111101
41233320110002210001
53432011302314222
6131104221214401
711451636112552
oct1577024024401
9374062011441
10120130119937
1146a46359163
121b347401401
13b436145609
145b58738329
1531d1609927
hex1bf8502901

120130119937 has 2 divisors, whose sum is σ = 120130119938. Its totient is φ = 120130119936.

The previous prime is 120130119919. The next prime is 120130119947. The reversal of 120130119937 is 739911031021.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 112875168961 + 7254950976 = 335969^2 + 85176^2 .

It is a cyclic number.

It is not a de Polignac number, because 120130119937 - 211 = 120130117889 is a prime.

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

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

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

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

Almost surely, 2120130119937 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10206, while the sum is 37.

The spelling of 120130119937 in words is "one hundred twenty billion, one hundred thirty million, one hundred nineteen thousand, nine hundred thirty-seven".