Base | Representation |
---|---|
bin | 111101001100011100001 |
3 | 10202212122022 |
4 | 13221203201 |
5 | 1003131332 |
6 | 110551225 |
7 | 23021054 |
oct | 7514341 |
9 | 3685568 |
10 | 2005217 |
11 | 114a605 |
12 | 808515 |
13 | 552926 |
14 | 3a2a9b |
15 | 299212 |
hex | 1e98e1 |
2005217 has 4 divisors (see below), whose sum is σ = 2020656. Its totient is φ = 1989780.
The previous prime is 2005207. The next prime is 2005229. The reversal of 2005217 is 7125002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2005217 - 216 = 1939681 is a prime.
It is a super-3 number, since 3×20052173 = 24188302333576659939, which contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2005195 and 2005204.
It is not an unprimeable number, because it can be changed into a prime (2005207) 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 in 3 ways as a sum of consecutive naturals, for example, 7523 + ... + 7784.
It is an arithmetic number, because the mean of its divisors is an integer number (505164).
22005217 is an apocalyptic number.
It is an amenable number.
2005217 is a deficient number, since it is larger than the sum of its proper divisors (15439).
2005217 is a wasteful number, since it uses less digits than its factorization.
2005217 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15438.
The product of its (nonzero) digits is 140, while the sum is 17.
The square root of 2005217 is about 1416.0568491413. The cubic root of 2005217 is about 126.1015600087.
It can be divided in two parts, 2005 and 217, that added together give a palindrome (2222).
The spelling of 2005217 in words is "two million, five thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •