Base | Representation |
---|---|
bin | 111111000000111010100 |
3 | 10212220110000 |
4 | 13320013110 |
5 | 1012033402 |
6 | 112131300 |
7 | 23356656 |
oct | 7700724 |
9 | 3786400 |
10 | 2064852 |
11 | 1190399 |
12 | 836b30 |
13 | 573b0a |
14 | 3ba6d6 |
15 | 2abc1c |
hex | 1f81d4 |
2064852 has 30 divisors (see below), whose sum is σ = 5398778. Its totient is φ = 688176.
The previous prime is 2064847. The next prime is 2064857. The reversal of 2064852 is 2584602.
It is an interprime number because it is at equal distance from previous prime (2064847) and next prime (2064857).
It can be written as a sum of positive squares in only one way, i.e., 1971216 + 93636 = 1404^2 + 306^2 .
It is a super-2 number, since 2×20648522 = 8527227563808, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2064857) by changing a digit.
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 9 ways as a sum of consecutive naturals, for example, 2863 + ... + 3510.
22064852 is an apocalyptic number.
It is an amenable number.
2064852 is an abundant number, since it is smaller than the sum of its proper divisors (3333926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2064852 is a wasteful number, since it uses less digits than its factorization.
2064852 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6389 (or 6378 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
The square root of 2064852 is about 1436.9592896112. The cubic root of 2064852 is about 127.3394519018.
It can be divided in two parts, 2064 and 852, that added together give a square (2916 = 542).
The spelling of 2064852 in words is "two million, sixty-four thousand, eight hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •