Base | Representation |
---|---|
bin | 10000000111100110011101 |
3 | 21221200012200 |
4 | 100013212131 |
5 | 2040203222 |
6 | 230322113 |
7 | 50626026 |
oct | 20074635 |
9 | 7850180 |
10 | 4225437 |
11 | 24266a7 |
12 | 14b9339 |
13 | b4c378 |
14 | 7bdc4d |
15 | 586eac |
hex | 40799d |
4225437 has 12 divisors (see below), whose sum is σ = 6268860. Its totient is φ = 2740608.
The previous prime is 4225427. The next prime is 4225439. The reversal of 4225437 is 7345224.
4225437 is a `hidden beast` number, since 4 + 225 + 437 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 2134521 + 2090916 = 1461^2 + 1446^2 .
It is not a de Polignac number, because 4225437 - 26 = 4225373 is a prime.
It is a d-powerful number, because it can be written as 46 + 25 + 29 + 55 + 411 + 38 + 75 .
It is a self number, because there is not a number n which added to its sum of digits gives 4225437.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4225439) 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 11 ways as a sum of consecutive naturals, for example, 6012 + ... + 6677.
It is an arithmetic number, because the mean of its divisors is an integer number (522405).
Almost surely, 24225437 is an apocalyptic number.
It is an amenable number.
4225437 is a deficient number, since it is larger than the sum of its proper divisors (2043423).
4225437 is a wasteful number, since it uses less digits than its factorization.
4225437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12732 (or 12729 counting only the distinct ones).
The product of its digits is 6720, while the sum is 27.
The square root of 4225437 is about 2055.5867775407. The cubic root of 4225437 is about 161.6679297501.
The spelling of 4225437 in words is "four million, two hundred twenty-five thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.148 sec. • engine limits •