Search a number
-
+
2120403157 is a prime number
BaseRepresentation
bin111111001100010…
…1100100011010101
312110202220122022021
41332120230203111
513320310400112
6550223333141
7103355062255
oct17630544325
95422818267
102120403157
11998a04304
124b21511b1
1327a3b2932
1416187b965
15c6247907
hex7e62c8d5

2120403157 has 2 divisors, whose sum is σ = 2120403158. Its totient is φ = 2120403156.

The previous prime is 2120403151. The next prime is 2120403169. The reversal of 2120403157 is 7513040212.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1388754756 + 731648401 = 37266^2 + 27049^2 .

It is a cyclic number.

It is not a de Polignac number, because 2120403157 - 215 = 2120370389 is a prime.

It is a super-2 number, since 2×21204031572 = 8992219096431133298, which contains 22 as substring.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 22120403157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1680, while the sum is 25.

The square root of 2120403157 is about 46047.8355300225. The cubic root of 2120403157 is about 1284.7130846651.

Adding to 2120403157 its reverse (7513040212), we get a palindrome (9633443369).

The spelling of 2120403157 in words is "two billion, one hundred twenty million, four hundred three thousand, one hundred fifty-seven".