Base | Representation |
---|---|
bin | 111111000111010011010 |
3 | 10220001221010 |
4 | 13320322122 |
5 | 1012134442 |
6 | 112154350 |
7 | 23402340 |
oct | 7707232 |
9 | 3801833 |
10 | 2068122 |
11 | 11928a1 |
12 | 8389b6 |
13 | 575454 |
14 | 3bb990 |
15 | 2acb9c |
hex | 1f8e9a |
2068122 has 32 divisors (see below), whose sum is σ = 4846464. Its totient is φ = 576000.
The previous prime is 2068117. The next prime is 2068123. The reversal of 2068122 is 2218602.
It is a Smith number, since the sum of its digits (21) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (2068123) 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, 1122 + ... + 2322.
It is an arithmetic number, because the mean of its divisors is an integer number (151452).
22068122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2068122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2423232).
2068122 is an abundant number, since it is smaller than the sum of its proper divisors (2778342).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2068122 is a wasteful number, since it uses less digits than its factorization.
2068122 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 384, while the sum is 21.
The square root of 2068122 is about 1438.0966587820. The cubic root of 2068122 is about 127.4066367639.
The spelling of 2068122 in words is "two million, sixty-eight thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •