Base | Representation |
---|---|
bin | 100011001010101… |
… | …100101011010001 |
3 | 1112010012110102212 |
4 | 203022230223101 |
5 | 2202020210433 |
6 | 134313521505 |
7 | 20422656002 |
oct | 4312545321 |
9 | 1463173385 |
10 | 590006993 |
11 | 283052a94 |
12 | 145713295 |
13 | 9530a284 |
14 | 585051a9 |
15 | 36be6d48 |
hex | 232acad1 |
590006993 has 2 divisors, whose sum is σ = 590006994. Its totient is φ = 590006992.
The previous prime is 590006987. The next prime is 590007007. The reversal of 590006993 is 399600095.
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., 577104529 + 12902464 = 24023^2 + 3592^2 .
It is a cyclic number.
It is not a de Polignac number, because 590006993 - 218 = 589744849 is a prime.
It is a Sophie Germain prime.
590006993 is a modest number, since divided by 6993 gives 590 as remainder.
It is a Curzon number.
It is equal to p30829919 and since 590006993 and 30829919 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 590006993.
It is not a weakly prime, because it can be changed into another prime (590006093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 295003496 + 295003497.
It is an arithmetic number, because the mean of its divisors is an integer number (295003497).
Almost surely, 2590006993 is an apocalyptic number.
It is an amenable number.
590006993 is a deficient number, since it is larger than the sum of its proper divisors (1).
590006993 is an equidigital number, since it uses as much as digits as its factorization.
590006993 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 65610, while the sum is 41.
The square root of 590006993 is about 24290.0595511827. The cubic root of 590006993 is about 838.7239662970.
The spelling of 590006993 in words is "five hundred ninety million, six thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •