Base | Representation |
---|---|
bin | 1111010000111000101010 |
3 | 21112021210010 |
4 | 33100320222 |
5 | 2011020242 |
6 | 221432350 |
7 | 46003443 |
oct | 17207052 |
9 | 7467703 |
10 | 4001322 |
11 | 2293286 |
12 | 140b6b6 |
13 | aa1360 |
14 | 7622ca |
15 | 54089c |
hex | 3d0e2a |
4001322 has 32 divisors (see below), whose sum is σ = 8826048. Its totient is φ = 1201536.
The previous prime is 4001303. The next prime is 4001339. The reversal of 4001322 is 2231004.
4001322 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an Ulam number.
It is a junction number, because it is equal to n+sod(n) for n = 4001298 and 4001307.
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 15 ways as a sum of consecutive naturals, for example, 2758 + ... + 3950.
It is an arithmetic number, because the mean of its divisors is an integer number (275814).
Almost surely, 24001322 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4001322, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4413024).
4001322 is an abundant number, since it is smaller than the sum of its proper divisors (4824726).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4001322 is a wasteful number, since it uses less digits than its factorization.
4001322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1254.
The product of its (nonzero) digits is 48, while the sum is 12.
The square root of 4001322 is about 2000.3304726969. The cubic root of 4001322 is about 158.7575911388.
Adding to 4001322 its reverse (2231004), we get a palindrome (6232326).
The spelling of 4001322 in words is "four million, one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •