Base | Representation |
---|---|
bin | 110000010111… |
… | …110101100110 |
3 | 212212020110000 |
4 | 300113311212 |
5 | 11221234200 |
6 | 1131442130 |
7 | 212532351 |
oct | 60276546 |
9 | 25766400 |
10 | 12680550 |
11 | 71810a3 |
12 | 42b6346 |
13 | 281c9ac |
14 | 1981298 |
15 | 11a7300 |
hex | c17d66 |
12680550 has 120 divisors (see below), whose sum is σ = 36729792. Its totient is φ = 3240000.
The previous prime is 12680537. The next prime is 12680557. The reversal of 12680550 is 5508621.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12680557) 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 59 ways as a sum of consecutive naturals, for example, 125500 + ... + 125600.
Almost surely, 212680550 is an apocalyptic number.
12680550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 12680550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18364896).
12680550 is an abundant number, since it is smaller than the sum of its proper divisors (24049242).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12680550 is a wasteful number, since it uses less digits than its factorization.
12680550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156 (or 142 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
The square root of 12680550 is about 3560.9759898095. The cubic root of 12680550 is about 233.1914897543.
The spelling of 12680550 in words is "twelve million, six hundred eighty thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •