Base | Representation |
---|---|
bin | 11000101000100110101 |
3 | 1112000022002 |
4 | 3011010311 |
5 | 201312341 |
6 | 25145045 |
7 | 6601262 |
oct | 3050465 |
9 | 1460262 |
10 | 807221 |
11 | 501528 |
12 | 32b185 |
13 | 22355c |
14 | 170269 |
15 | 10e29b |
hex | c5135 |
807221 has 2 divisors, whose sum is σ = 807222. Its totient is φ = 807220.
The previous prime is 807217. The next prime is 807241. The reversal of 807221 is 122708.
It is an a-pointer prime, because the next prime (807241) can be obtained adding 807221 to its sum of digits (20).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 790321 + 16900 = 889^2 + 130^2 .
It is a cyclic number.
It is not a de Polignac number, because 807221 - 22 = 807217 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a plaindrome in base 13.
It is a junction number, because it is equal to n+sod(n) for n = 807193 and 807202.
It is a congruent number.
It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 807221.
It is not a weakly prime, because it can be changed into another prime (807241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 403610 + 403611.
It is an arithmetic number, because the mean of its divisors is an integer number (403611).
2807221 is an apocalyptic number.
It is an amenable number.
807221 is a deficient number, since it is larger than the sum of its proper divisors (1).
807221 is an equidigital number, since it uses as much as digits as its factorization.
807221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 20.
The square root of 807221 is about 898.4547846163. The cubic root of 807221 is about 93.1102481025.
Adding to 807221 its reverse (122708), we get a palindrome (929929).
The spelling of 807221 in words is "eight hundred seven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •