Base | Representation |
---|---|
bin | 110000001111… |
… | …111000111001 |
3 | 212210120210012 |
4 | 300033320321 |
5 | 11214213433 |
6 | 1131031305 |
7 | 212335421 |
oct | 60177071 |
9 | 25716705 |
10 | 12647993 |
11 | 7159696 |
12 | 429b535 |
13 | 280ac27 |
14 | 1973481 |
15 | 119c848 |
hex | c0fe39 |
12647993 has 4 divisors (see below), whose sum is σ = 12655140. Its totient is φ = 12640848.
The previous prime is 12647989. The next prime is 12648001. The reversal of 12647993 is 39974621.
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 7139584 + 5508409 = 2672^2 + 2347^2 .
It is a cyclic number.
It is not a de Polignac number, because 12647993 - 22 = 12647989 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12647993.
It is not an unprimeable number, because it can be changed into a prime (12647903) 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 3 ways as a sum of consecutive naturals, for example, 1271 + ... + 5187.
It is an arithmetic number, because the mean of its divisors is an integer number (3163785).
Almost surely, 212647993 is an apocalyptic number.
It is an amenable number.
12647993 is a deficient number, since it is larger than the sum of its proper divisors (7147).
12647993 is an equidigital number, since it uses as much as digits as its factorization.
12647993 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7146.
The product of its digits is 81648, while the sum is 41.
The square root of 12647993 is about 3556.4016927226. The cubic root of 12647993 is about 232.9917475756.
The spelling of 12647993 in words is "twelve million, six hundred forty-seven thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •