Base | Representation |
---|---|
bin | 110000010100… |
… | …001011011000 |
3 | 212211110212211 |
4 | 300110023120 |
5 | 11220244220 |
6 | 1131244504 |
7 | 212440555 |
oct | 60241330 |
9 | 25743784 |
10 | 12665560 |
11 | 7170906 |
12 | 42a9734 |
13 | 2815c1b |
14 | 1979a2c |
15 | 11a2b5a |
hex | c142d8 |
12665560 has 32 divisors (see below), whose sum is σ = 29108160. Its totient is φ = 4957696.
The previous prime is 12665557. The next prime is 12665563. The reversal of 12665560 is 6556621.
It is an interprime number because it is at equal distance from previous prime (12665557) and next prime (12665563).
It is a super-2 number, since 2×126655602 = 320832820227200, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12665563) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1489 + ... + 5248.
It is an arithmetic number, because the mean of its divisors is an integer number (909630).
Almost surely, 212665560 is an apocalyptic number.
12665560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12665560 is an abundant number, since it is smaller than the sum of its proper divisors (16442600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12665560 is a wasteful number, since it uses less digits than its factorization.
12665560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6795 (or 6791 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 31.
The square root of 12665560 is about 3558.8706073697. The cubic root of 12665560 is about 233.0995663302.
It can be divided in two parts, 12665 and 560, that added together give a square (13225 = 1152).
The spelling of 12665560 in words is "twelve million, six hundred sixty-five thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •