Base | Representation |
---|---|
bin | 100000001000… |
… | …001101100001 |
3 | 120211220010212 |
4 | 200020031201 |
5 | 4124002431 |
6 | 500303505 |
7 | 131405432 |
oct | 40101541 |
9 | 16756125 |
10 | 8422241 |
11 | 4832833 |
12 | 29a1b95 |
13 | 198b699 |
14 | 1193489 |
15 | b1572b |
hex | 808361 |
8422241 has 2 divisors, whose sum is σ = 8422242. Its totient is φ = 8422240.
The previous prime is 8422237. The next prime is 8422243. The reversal of 8422241 is 1422248.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5271616 + 3150625 = 2296^2 + 1775^2 .
It is a cyclic number.
It is not a de Polignac number, because 8422241 - 22 = 8422237 is a prime.
It is a Sophie Germain prime.
Together with 8422243, it forms a pair of twin primes.
It is a Chen prime.
It is an Ulam number.
It is a d-powerful number, because it can be written as 83 + 43 + 25 + 215 + 223 + 44 + 1 .
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (8422243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4211120 + 4211121.
It is an arithmetic number, because the mean of its divisors is an integer number (4211121).
Almost surely, 28422241 is an apocalyptic number.
It is an amenable number.
8422241 is a deficient number, since it is larger than the sum of its proper divisors (1).
8422241 is an equidigital number, since it uses as much as digits as its factorization.
8422241 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1024, while the sum is 23.
The square root of 8422241 is about 2902.1097498199. The cubic root of 8422241 is about 203.4585233421.
Adding to 8422241 its reverse (1422248), we get a palindrome (9844489).
The spelling of 8422241 in words is "eight million, four hundred twenty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.284 sec. • engine limits •