485090141 has 2 divisors, whose sum is σ = 485090142. Its totient is φ = 485090140.

The previous prime is 485090063. The next prime is 485090209. The reversal of 485090141 is 141090584.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 476505241 + 8584900 = 21829^2 + 2930^2 .

It is a cyclic number.

It is not a de Polignac number, because 485090141 - 2¹⁰ = 485089117 is a prime.

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

It is equal to p_25610846 and since 485090141 and 25610846 have the same sum of digits, it is a Honaker prime.

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

It is a congruent number.

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

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

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

Almost surely, 2^485090141 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 485090141 is about 22024.7619964439. The cubic root of 485090141 is about 785.7314728440.

The spelling of 485090141 in words is "four hundred eighty-five million, ninety thousand, one hundred forty-one".