Search a number
-
+
590858249 is a prime number
BaseRepresentation
bin100011001101111…
…100100000001001
31112011210201010212
4203031330200021
52202224430444
6134344050505
720433132542
oct4315744011
91464721125
10590858249
11283584603
12145a63a35
1395547887
14586874c9
1536d1419e
hex2337c809

590858249 has 2 divisors, whose sum is σ = 590858250. Its totient is φ = 590858248.

The previous prime is 590858221. The next prime is 590858251. The reversal of 590858249 is 942858095.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 515290000 + 75568249 = 22700^2 + 8693^2 .

It is a cyclic number.

It is not a de Polignac number, because 590858249 - 220 = 589809673 is a prime.

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

Together with 590858251, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

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

Almost surely, 2590858249 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1036800, while the sum is 50.

The square root of 590858249 is about 24307.5759589474. The cubic root of 590858249 is about 839.1271398882.

The spelling of 590858249 in words is "five hundred ninety million, eight hundred fifty-eight thousand, two hundred forty-nine".