Base | Representation |
---|---|
bin | 1001111101101101010100 |
3 | 11220201001200 |
4 | 21331231110 |
5 | 1132041202 |
6 | 131552500 |
7 | 31126212 |
oct | 11755524 |
9 | 4821050 |
10 | 2612052 |
11 | 1524523 |
12 | a5b730 |
13 | 705bc1 |
14 | 4bdcb2 |
15 | 368e1c |
hex | 27db54 |
2612052 has 54 divisors (see below), whose sum is σ = 6913998. Its totient is φ = 831168.
The previous prime is 2612039. The next prime is 2612083. The reversal of 2612052 is 2502162.
2612052 is a `hidden beast` number, since 2 + 612 + 0 + 52 = 666.
It can be written as a sum of positive squares in 3 ways, for example, as 1758276 + 853776 = 1326^2 + 924^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
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 17 ways as a sum of consecutive naturals, for example, 49258 + ... + 49310.
It is an arithmetic number, because the mean of its divisors is an integer number (128037).
22612052 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 2612052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3456999).
2612052 is an abundant number, since it is smaller than the sum of its proper divisors (4301946).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2612052 is a wasteful number, since it uses less digits than its factorization.
2612052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137 (or 95 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 2612052 is about 1616.1843954203. The cubic root of 2612052 is about 137.7190250324.
The spelling of 2612052 in words is "two million, six hundred twelve thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •