Base | Representation |
---|---|
bin | 1111010101110101101000 |
3 | 21120022121110 |
4 | 33111311220 |
5 | 2012142413 |
6 | 222110320 |
7 | 46116543 |
oct | 17256550 |
9 | 7508543 |
10 | 4021608 |
11 | 22a7548 |
12 | 141b3a0 |
13 | aaa666 |
14 | 76985a |
15 | 5468c3 |
hex | 3d5d68 |
4021608 has 64 divisors (see below), whose sum is σ = 10624320. Its totient is φ = 1267200.
The previous prime is 4021607. The next prime is 4021613. The reversal of 4021608 is 8061204.
It is an Ulam number.
It is a nialpdrome in base 13.
It is a zygodrome in base 13.
It is not an unprimeable number, because it can be changed into a prime (4021601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 59991 + ... + 60057.
It is an arithmetic number, because the mean of its divisors is an integer number (166005).
Almost surely, 24021608 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4021608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5312160).
4021608 is an abundant number, since it is smaller than the sum of its proper divisors (6602712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4021608 is a wasteful number, since it uses less digits than its factorization.
4021608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178 (or 174 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
The square root of 4021608 is about 2005.3947242376. The cubic root of 4021608 is about 159.0254300531.
It can be divided in two parts, 402 and 1608, that multiplied together give a square (646416 = 8042).
The spelling of 4021608 in words is "four million, twenty-one thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •