Base | Representation |
---|---|
bin | 10000000100000101001110 |
3 | 21220221102210 |
4 | 100010011032 |
5 | 2034223042 |
6 | 230131250 |
7 | 50536014 |
oct | 20040516 |
9 | 7827383 |
10 | 4211022 |
11 | 2416892 |
12 | 14b0b26 |
13 | b4593a |
14 | 7b88b4 |
15 | 582a9c |
hex | 40414e |
4211022 has 8 divisors (see below), whose sum is σ = 8422056. Its totient is φ = 1403672.
The previous prime is 4211021. The next prime is 4211023. The reversal of 4211022 is 2201124.
It is an interprime number because it is at equal distance from previous prime (4211021) and next prime (4211023).
It is a sphenic number, since it is the product of 3 distinct primes.
4211022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 4210989 and 4211007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4211021) 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 in 3 ways as a sum of consecutive naturals, for example, 350913 + ... + 350924.
It is an arithmetic number, because the mean of its divisors is an integer number (1052757).
Almost surely, 24211022 is an apocalyptic number.
4211022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4211022 is a wasteful number, since it uses less digits than its factorization.
4211022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 701842.
The product of its (nonzero) digits is 32, while the sum is 12.
The square root of 4211022 is about 2052.0774839172. The cubic root of 4211022 is about 161.4838779128.
Adding to 4211022 its reverse (2201124), we get a palindrome (6412146).
The spelling of 4211022 in words is "four million, two hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •