Base | Representation |
---|---|
bin | 10000000111111001101001 |
3 | 21221201220011 |
4 | 100013321221 |
5 | 2040223130 |
6 | 230331521 |
7 | 50632432 |
oct | 20077151 |
9 | 7851804 |
10 | 4226665 |
11 | 2427613 |
12 | 14b9ba1 |
13 | b4cab1 |
14 | 7c0489 |
15 | 58752a |
hex | 407e69 |
4226665 has 4 divisors (see below), whose sum is σ = 5072004. Its totient is φ = 3381328.
The previous prime is 4226657. The next prime is 4226671. The reversal of 4226665 is 5666224.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2347024 + 1879641 = 1532^2 + 1371^2 .
It is a cyclic number.
It is not a de Polignac number, because 4226665 - 23 = 4226657 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a d-powerful number, because it can be written as 43 + 214 + 222 + 62 + 62 + 63 + 56 .
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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, 422662 + ... + 422671.
It is an arithmetic number, because the mean of its divisors is an integer number (1268001).
Almost surely, 24226665 is an apocalyptic number.
It is an amenable number.
4226665 is a deficient number, since it is larger than the sum of its proper divisors (845339).
4226665 is an equidigital number, since it uses as much as digits as its factorization.
4226665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 845338.
The product of its digits is 17280, while the sum is 31.
The square root of 4226665 is about 2055.8854540076. The cubic root of 4226665 is about 161.6835895890.
The spelling of 4226665 in words is "four million, two hundred twenty-six thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •