Search a number
-
+
490153109 is a prime number
BaseRepresentation
bin11101001101110…
…010010010010101
31021011022100122212
4131031302102111
52000434344414
6120345403205
715101142545
oct3515622225
91234270585
10490153109
11231751316
12118199505
137a718134
1449151325
152d07083e
hex1d372495

490153109 has 2 divisors, whose sum is σ = 490153110. Its totient is φ = 490153108.

The previous prime is 490153091. The next prime is 490153141. The reversal of 490153109 is 901351094.

Together with previous prime (490153091) it forms an Ormiston pair, because they use the same digits, order apart.

It is an a-pointer prime, because the next prime (490153141) can be obtained adding 490153109 to its sum of digits (32).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 480574084 + 9579025 = 21922^2 + 3095^2 .

It is a cyclic number.

It is not a de Polignac number, because 490153109 - 28 = 490152853 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 2490153109 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4860, while the sum is 32.

The square root of 490153109 is about 22139.4017308508. The cubic root of 490153109 is about 788.4556214197.

The spelling of 490153109 in words is "four hundred ninety million, one hundred fifty-three thousand, one hundred nine".