Base | Representation |
---|---|
bin | 1011100010100111010001 |
3 | 12200201000102 |
4 | 23202213101 |
5 | 1233302421 |
6 | 144502145 |
7 | 34500203 |
oct | 13424721 |
9 | 5621012 |
10 | 3025361 |
11 | 1786aa9 |
12 | 101a955 |
13 | 81c071 |
14 | 58a773 |
15 | 3eb60b |
hex | 2e29d1 |
3025361 has 2 divisors, whose sum is σ = 3025362. Its totient is φ = 3025360.
The previous prime is 3025357. The next prime is 3025369. The reversal of 3025361 is 1635203.
3025361 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2907025 + 118336 = 1705^2 + 344^2 .
It is a cyclic number.
It is not a de Polignac number, because 3025361 - 22 = 3025357 is a prime.
It is equal to p218504 and since 3025361 and 218504 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (3025369) 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, 1512680 + 1512681.
It is an arithmetic number, because the mean of its divisors is an integer number (1512681).
Almost surely, 23025361 is an apocalyptic number.
It is an amenable number.
3025361 is a deficient number, since it is larger than the sum of its proper divisors (1).
3025361 is an equidigital number, since it uses as much as digits as its factorization.
3025361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 20.
The square root of 3025361 is about 1739.3564901998. The cubic root of 3025361 is about 144.6302270651.
It can be divided in two parts, 3025 and 361, that multiplied together give a square (1092025 = 10452).
The spelling of 3025361 in words is "three million, twenty-five thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •