Base | Representation |
---|---|
bin | 10110111011100010101100 |
3 | 102022101121120 |
4 | 112323202230 |
5 | 3014323202 |
6 | 332500540 |
7 | 102043635 |
oct | 26734254 |
9 | 12271546 |
10 | 6011052 |
11 | 3436213 |
12 | 201a750 |
13 | 1326048 |
14 | b2688c |
15 | 7db0bc |
hex | 5bb8ac |
6011052 has 12 divisors (see below), whose sum is σ = 14025816. Its totient is φ = 2003680.
The previous prime is 6011029. The next prime is 6011053. The reversal of 6011052 is 2501106.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×60110522 = 72265492293408, which contains 22 as substring.
It is an Ulam number.
It is not an unprimeable number, because it can be changed into a prime (6011053) 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 3 ways as a sum of consecutive naturals, for example, 250449 + ... + 250472.
It is an arithmetic number, because the mean of its divisors is an integer number (1168818).
Almost surely, 26011052 is an apocalyptic number.
It is an amenable number.
6011052 is an abundant number, since it is smaller than the sum of its proper divisors (8014764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6011052 is a wasteful number, since it uses less digits than its factorization.
6011052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 500928 (or 500926 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 15.
The square root of 6011052 is about 2451.7446849132. The cubic root of 6011052 is about 181.8235620529.
Adding to 6011052 its reverse (2501106), we get a palindrome (8512158).
It can be divided in two parts, 601 and 1052, that added together give a triangular number (1653 = T57).
The spelling of 6011052 in words is "six million, eleven thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •