Search a number
-
+
120203000523157 is a prime number
BaseRepresentation
bin11011010101001011110001…
…001001011010100110010101
3120202121021221210002002102011
4123111023301021122212111
5111223401221113220112
61103352255054344221
734214244260153116
oct3325136111324625
9522537853062364
10120203000523157
1135333896122912
12115941917bb071
13520c12c284526
142197bdb85220d
15dd6b51223aa7
hex6d52f125a995

120203000523157 has 2 divisors, whose sum is σ = 120203000523158. Its totient is φ = 120203000523156.

The previous prime is 120203000523139. The next prime is 120203000523209. The reversal of 120203000523157 is 751325000302021.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 117008484166116 + 3194516357041 = 10817046^2 + 1787321^2 .

It is a cyclic number.

It is not a de Polignac number, because 120203000523157 - 27 = 120203000523029 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2120203000523157 is an apocalyptic number.

It is an amenable number.

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

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

120203000523157 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 12600, while the sum is 31.

Adding to 120203000523157 its reverse (751325000302021), we get a palindrome (871528000825178).

The spelling of 120203000523157 in words is "one hundred twenty trillion, two hundred three billion, five hundred twenty-three thousand, one hundred fifty-seven".