Base | Representation |
---|---|
bin | 1001111000011010011001 |
3 | 11212121022022 |
4 | 21320122121 |
5 | 1130342421 |
6 | 131304225 |
7 | 31006034 |
oct | 11703231 |
9 | 4777268 |
10 | 2590361 |
11 | 150a1a4 |
12 | a4b075 |
13 | 6c9077 |
14 | 4b601b |
15 | 3627ab |
hex | 278699 |
2590361 has 2 divisors, whose sum is σ = 2590362. Its totient is φ = 2590360.
The previous prime is 2590349. The next prime is 2590369. The reversal of 2590361 is 1630952.
2590361 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2175625 + 414736 = 1475^2 + 644^2 .
It is a cyclic number.
It is not a de Polignac number, because 2590361 - 218 = 2328217 is a prime.
It is a super-2 number, since 2×25903612 = 13419940220642, which contains 22 as substring.
It is an Ulam number.
It is a self number, because there is not a number n which added to its sum of digits gives 2590361.
It is not a weakly prime, because it can be changed into another prime (2590369) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1295180 + 1295181.
It is an arithmetic number, because the mean of its divisors is an integer number (1295181).
22590361 is an apocalyptic number.
It is an amenable number.
2590361 is a deficient number, since it is larger than the sum of its proper divisors (1).
2590361 is an equidigital number, since it uses as much as digits as its factorization.
2590361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 26.
The square root of 2590361 is about 1609.4598472780. The cubic root of 2590361 is about 137.3367495039.
The spelling of 2590361 in words is "two million, five hundred ninety thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •