Base | Representation |
---|---|
bin | 110000000110… |
… | …110111101100 |
3 | 212201201010000 |
4 | 300012313230 |
5 | 11212023202 |
6 | 1130144300 |
7 | 212122626 |
oct | 60066754 |
9 | 25651100 |
10 | 12611052 |
11 | 7133963 |
12 | 4282090 |
13 | 27c717c |
14 | 1963c16 |
15 | 119191c |
hex | c06dec |
12611052 has 30 divisors (see below), whose sum is σ = 32968628. Its totient is φ = 4203576.
The previous prime is 12611051. The next prime is 12611057. The reversal of 12611052 is 25011621.
12611052 is a `hidden beast` number, since 1 + 2 + 611 + 0 + 52 = 666.
12611052 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×126110523 (a number of 22 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (12611051) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 19138 + ... + 19785.
Almost surely, 212611052 is an apocalyptic number.
12611052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12611052 is an abundant number, since it is smaller than the sum of its proper divisors (20357576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12611052 is a wasteful number, since it uses less digits than its factorization.
12611052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38939 (or 38928 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
The square root of 12611052 is about 3551.2043027683. The cubic root of 12611052 is about 232.7646933384.
Adding to 12611052 its reverse (25011621), we get a palindrome (37622673).
The spelling of 12611052 in words is "twelve million, six hundred eleven thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •