Base | Representation |
---|---|
bin | 111110111111010111110 |
3 | 10212212100202 |
4 | 13313322332 |
5 | 1012022222 |
6 | 112123502 |
7 | 23354450 |
oct | 7677276 |
9 | 3785322 |
10 | 2064062 |
11 | 118a840 |
12 | 836592 |
13 | 573650 |
14 | 3ba2d0 |
15 | 2ab892 |
hex | 1f7ebe |
2064062 has 32 divisors (see below), whose sum is σ = 4161024. Its totient is φ = 741600.
The previous prime is 2064061. The next prime is 2064067. The reversal of 2064062 is 2604602.
It is a Smith number, since the sum of its digits (20) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2064061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1487 + ... + 2517.
It is an arithmetic number, because the mean of its divisors is an integer number (130032).
22064062 is an apocalyptic number.
2064062 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2064062 is an abundant number, since it is smaller than the sum of its proper divisors (2096962).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2064062 is a wasteful number, since it uses less digits than its factorization.
2064062 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1064.
The product of its (nonzero) digits is 576, while the sum is 20.
The square root of 2064062 is about 1436.6843773077. The cubic root of 2064062 is about 127.3232100599.
Adding to 2064062 its reverse (2604602), we get a palindrome (4668664).
It can be divided in two parts, 20640 and 62, that added together give a palindrome (20702).
The spelling of 2064062 in words is "two million, sixty-four thousand, sixty-two", and thus it is an eban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •