Base | Representation |
---|---|
bin | 110000010011… |
… | …000101000000 |
3 | 212211020201000 |
4 | 300103011000 |
5 | 11220123211 |
6 | 1131212000 |
7 | 212421462 |
oct | 60230500 |
9 | 25736630 |
10 | 12661056 |
11 | 7168491 |
12 | 42a7000 |
13 | 2813b65 |
14 | 1978132 |
15 | 11a1656 |
hex | c13140 |
12661056 has 112 divisors (see below), whose sum is σ = 39502080. Its totient is φ = 3962880.
The previous prime is 12661043. The next prime is 12661091. The reversal of 12661056 is 65016621.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29161 + ... + 29591.
Almost surely, 212661056 is an apocalyptic number.
12661056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12661056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19751040).
12661056 is an abundant number, since it is smaller than the sum of its proper divisors (26841024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12661056 is a wasteful number, since it uses less digits than its factorization.
12661056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 469 (or 453 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 12661056 is about 3558.2377660859. The cubic root of 12661056 is about 233.0719322075.
Adding to 12661056 its reverse (65016621), we get a palindrome (77677677).
The spelling of 12661056 in words is "twelve million, six hundred sixty-one thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •