Base | Representation |
---|---|
bin | 1011100011010000110101 |
3 | 12200211122221 |
4 | 23203100311 |
5 | 1233344041 |
6 | 144522341 |
7 | 34511023 |
oct | 13432065 |
9 | 5624587 |
10 | 3028021 |
11 | 1788aa7 |
12 | 10203b1 |
13 | 820339 |
14 | 58b713 |
15 | 3ec2d1 |
hex | 2e3435 |
3028021 has 2 divisors, whose sum is σ = 3028022. Its totient is φ = 3028020.
The previous prime is 3028007. The next prime is 3028027. The reversal of 3028021 is 1208203.
It is a happy number.
3028021 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., 2788900 + 239121 = 1670^2 + 489^2 .
It is a cyclic number.
It is not a de Polignac number, because 3028021 - 29 = 3027509 is a prime.
It is a super-2 number, since 2×30280212 = 18337822352882, which contains 22 as substring.
It is an Ulam number.
It is a junction number, because it is equal to n+sod(n) for n = 3027986 and 3028004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3028027) 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, 1514010 + 1514011.
It is an arithmetic number, because the mean of its divisors is an integer number (1514011).
Almost surely, 23028021 is an apocalyptic number.
It is an amenable number.
3028021 is a deficient number, since it is larger than the sum of its proper divisors (1).
3028021 is an equidigital number, since it uses as much as digits as its factorization.
3028021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 3028021 is about 1740.1209728062. The cubic root of 3028021 is about 144.6726025818.
The spelling of 3028021 in words is "three million, twenty-eight thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •