Base | Representation |
---|---|
bin | 1000011111100100101001 |
3 | 11012010010222 |
4 | 20133210221 |
5 | 1032221343 |
6 | 115415425 |
7 | 24632114 |
oct | 10374451 |
9 | 4163128 |
10 | 2226473 |
11 | 1290867 |
12 | 8b4575 |
13 | 5cc552 |
14 | 41d57b |
15 | 2dea68 |
hex | 21f929 |
2226473 has 4 divisors (see below), whose sum is σ = 2357460. Its totient is φ = 2095488.
The previous prime is 2226467. The next prime is 2226479. The reversal of 2226473 is 3746222.
2226473 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (2226467) and next prime (2226479).
It can be written as a sum of positive squares in 2 ways, for example, as 1968409 + 258064 = 1403^2 + 508^2 .
It is not a de Polignac number, because 2226473 - 26 = 2226409 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2226479) 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, 65468 + ... + 65501.
It is an arithmetic number, because the mean of its divisors is an integer number (589365).
22226473 is an apocalyptic number.
It is an amenable number.
2226473 is a deficient number, since it is larger than the sum of its proper divisors (130987).
2226473 is a wasteful number, since it uses less digits than its factorization.
2226473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130986.
The product of its digits is 4032, while the sum is 26.
The square root of 2226473 is about 1492.1370580480. The cubic root of 2226473 is about 130.5787412035.
The spelling of 2226473 in words is "two million, two hundred twenty-six thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •