Base | Representation |
---|---|
bin | 10000000110011011100111 |
3 | 21221102122021 |
4 | 100012123213 |
5 | 2040030042 |
6 | 230244011 |
7 | 50606044 |
oct | 20063347 |
9 | 7842567 |
10 | 4220647 |
11 | 2423042 |
12 | 14b6607 |
13 | b4a132 |
14 | 7bc1cb |
15 | 585867 |
hex | 4066e7 |
4220647 has 8 divisors (see below), whose sum is σ = 4363200. Its totient is φ = 4080384.
The previous prime is 4220639. The next prime is 4220653. The reversal of 4220647 is 7460224.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4220647 - 23 = 4220639 is a prime.
It is a super-2 number, since 2×42206472 = 35627722197218, which contains 22 as substring.
It is a d-powerful number, because it can be written as 47 + 27 + 211 + 0 + 65 + 411 + 7 .
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4220617) 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 7 ways as a sum of consecutive naturals, for example, 3679 + ... + 4687.
It is an arithmetic number, because the mean of its divisors is an integer number (545400).
Almost surely, 24220647 is an apocalyptic number.
4220647 is a gapful number since it is divisible by the number (47) formed by its first and last digit.
4220647 is a deficient number, since it is larger than the sum of its proper divisors (142553).
4220647 is a wasteful number, since it uses less digits than its factorization.
4220647 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1145.
The product of its (nonzero) digits is 2688, while the sum is 25.
The square root of 4220647 is about 2054.4213297179. The cubic root of 4220647 is about 161.6068171609.
The spelling of 4220647 in words is "four million, two hundred twenty thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •