Base | Representation |
---|---|
bin | 1011011111001010010101 |
3 | 12122222121201 |
4 | 23133022111 |
5 | 1232324341 |
6 | 144312501 |
7 | 34411033 |
oct | 13371225 |
9 | 5588551 |
10 | 3011221 |
11 | 1777414 |
12 | 1012731 |
13 | 8157b5 |
14 | 585553 |
15 | 3e7331 |
hex | 2df295 |
3011221 has 2 divisors, whose sum is σ = 3011222. Its totient is φ = 3011220.
The previous prime is 3011219. The next prime is 3011231. The reversal of 3011221 is 1221103.
It is an a-pointer prime, because the next prime (3011231) can be obtained adding 3011221 to its sum of digits (10).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2686321 + 324900 = 1639^2 + 570^2 .
It is a cyclic number.
It is not a de Polignac number, because 3011221 - 21 = 3011219 is a prime.
Together with 3011219, 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 = 3011198 and 3011207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3011231) 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, 1505610 + 1505611.
It is an arithmetic number, because the mean of its divisors is an integer number (1505611).
Almost surely, 23011221 is an apocalyptic number.
It is an amenable number.
3011221 is a deficient number, since it is larger than the sum of its proper divisors (1).
3011221 is an equidigital number, since it uses as much as digits as its factorization.
3011221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 3011221 is about 1735.2870079615. The cubic root of 3011221 is about 144.4045497757.
Adding to 3011221 its reverse (1221103), we get a palindrome (4232324).
The spelling of 3011221 in words is "three million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •