Base | Representation |
---|---|
bin | 110000010111… |
… | …011000110001 |
3 | 212212010220200 |
4 | 300113120301 |
5 | 11221204310 |
6 | 1131425413 |
7 | 212524104 |
oct | 60273061 |
9 | 25763820 |
10 | 12678705 |
11 | 717a776 |
12 | 42b5269 |
13 | 281bbc0 |
14 | 198073b |
15 | 11a69c0 |
hex | c17631 |
12678705 has 24 divisors (see below), whose sum is σ = 23668008. Its totient is φ = 6241536.
The previous prime is 12678689. The next prime is 12678707. The reversal of 12678705 is 50787621.
It can be written as a sum of positive squares in 4 ways, for example, as 2547216 + 10131489 = 1596^2 + 3183^2 .
It is not a de Polignac number, because 12678705 - 24 = 12678689 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12678705.
It is not an unprimeable number, because it can be changed into a prime (12678707) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10252 + ... + 11421.
It is an arithmetic number, because the mean of its divisors is an integer number (986167).
Almost surely, 212678705 is an apocalyptic number.
12678705 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12678705 is a deficient number, since it is larger than the sum of its proper divisors (10989303).
12678705 is a wasteful number, since it uses less digits than its factorization.
12678705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21697 (or 21694 counting only the distinct ones).
The product of its (nonzero) digits is 23520, while the sum is 36.
The square root of 12678705 is about 3560.7169221942. The cubic root of 12678705 is about 233.1801795413.
The spelling of 12678705 in words is "twelve million, six hundred seventy-eight thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •