Base | Representation |
---|---|
bin | 110000011110… |
… | …001010110001 |
3 | 212220120000102 |
4 | 300132022301 |
5 | 11223101411 |
6 | 1132202145 |
7 | 213001064 |
oct | 60361261 |
9 | 25816012 |
10 | 12706481 |
11 | 7199627 |
12 | 4309355 |
13 | 282b738 |
14 | 198a8db |
15 | 11aed3b |
hex | c1e2b1 |
12706481 has 4 divisors (see below), whose sum is σ = 12787572. Its totient is φ = 12625392.
The previous prime is 12706471. The next prime is 12706489. The reversal of 12706481 is 18460721.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 18460721 = 419 ⋅44059.
It can be written as a sum of positive squares in 2 ways, for example, as 4389025 + 8317456 = 2095^2 + 2884^2 .
It is a cyclic number.
It is not a de Polignac number, because 12706481 - 218 = 12444337 is a prime.
It is a super-2 number, since 2×127064812 = 322909318806722, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12706489) 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 3 ways as a sum of consecutive naturals, for example, 40310 + ... + 40623.
It is an arithmetic number, because the mean of its divisors is an integer number (3196893).
Almost surely, 212706481 is an apocalyptic number.
It is an amenable number.
12706481 is a deficient number, since it is larger than the sum of its proper divisors (81091).
12706481 is an equidigital number, since it uses as much as digits as its factorization.
12706481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81090.
The product of its (nonzero) digits is 2688, while the sum is 29.
The square root of 12706481 is about 3564.6151264898. The cubic root of 12706481 is about 233.3503359492.
The spelling of 12706481 in words is "twelve million, seven hundred six thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •