Search a number
-
+
490198141 is a prime number
BaseRepresentation
bin11101001101111…
…101010001111101
31021011101122102201
4131031331101331
52000442320031
6120350351501
715101421046
oct3515752175
91234348381
10490198141
11231782134
121181bb591
137a732794
14491638cd
152d07dd61
hex1d37d47d

490198141 has 2 divisors, whose sum is σ = 490198142. Its totient is φ = 490198140.

The previous prime is 490198069. The next prime is 490198153. The reversal of 490198141 is 141891094.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 263575225 + 226622916 = 16235^2 + 15054^2 .

It is a cyclic number.

It is not a de Polignac number, because 490198141 - 211 = 490196093 is a prime.

It is a Chen prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2490198141 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 490198141 is about 22140.4187178111. The cubic root of 490198141 is about 788.4797666957.

The spelling of 490198141 in words is "four hundred ninety million, one hundred ninety-eight thousand, one hundred forty-one".