Base | Representation |
---|---|
bin | 110000010000… |
… | …000000100001 |
3 | 212210121110021 |
4 | 300100000201 |
5 | 11214222411 |
6 | 1131033441 |
7 | 212340016 |
oct | 60200041 |
9 | 25717407 |
10 | 12648481 |
11 | 7159a9a |
12 | 429b881 |
13 | 280b211 |
14 | 197370d |
15 | 119ca71 |
hex | c10021 |
12648481 has 4 divisors (see below), whose sum is σ = 12655764. Its totient is φ = 12641200.
The previous prime is 12648473. The next prime is 12648511. The reversal of 12648481 is 18484621.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 8904256 + 3744225 = 2984^2 + 1935^2 .
It is a cyclic number.
It is not a de Polignac number, because 12648481 - 23 = 12648473 is a prime.
It is a super-2 number, since 2×126484812 = 319968143214722, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12648401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 651 + ... + 5071.
It is an arithmetic number, because the mean of its divisors is an integer number (3163941).
Almost surely, 212648481 is an apocalyptic number.
It is an amenable number.
12648481 is a deficient number, since it is larger than the sum of its proper divisors (7283).
12648481 is an equidigital number, since it uses as much as digits as its factorization.
12648481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7282.
The product of its digits is 12288, while the sum is 34.
The square root of 12648481 is about 3556.4703007336. The cubic root of 12648481 is about 232.9947440592.
The spelling of 12648481 in words is "twelve million, six hundred forty-eight thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •