Base | Representation |
---|---|
bin | 110001100011… |
… | …100001010011 |
3 | 220102222200101 |
4 | 301203201103 |
5 | 11311144142 |
6 | 1142233231 |
7 | 215263213 |
oct | 61434123 |
9 | 26388611 |
10 | 12990547 |
11 | 7372a99 |
12 | 4425817 |
13 | 28cab1b |
14 | 1a22243 |
15 | 12190b7 |
hex | c63853 |
12990547 has 4 divisors (see below), whose sum is σ = 13674280. Its totient is φ = 12306816.
The previous prime is 12990541. The next prime is 12990553. The reversal of 12990547 is 74509921.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 74509921 = 1163 ⋅64067.
It is an interprime number because it is at equal distance from previous prime (12990541) and next prime (12990553).
It is a cyclic number.
It is not a de Polignac number, because 12990547 - 223 = 4601939 is a prime.
It is a super-2 number, since 2×129905472 = 337508622718418, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12990541) 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, 341838 + ... + 341875.
It is an arithmetic number, because the mean of its divisors is an integer number (3418570).
Almost surely, 212990547 is an apocalyptic number.
12990547 is a deficient number, since it is larger than the sum of its proper divisors (683733).
12990547 is an equidigital number, since it uses as much as digits as its factorization.
12990547 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 683732.
The product of its (nonzero) digits is 22680, while the sum is 37.
The square root of 12990547 is about 3604.2401418329. The cubic root of 12990547 is about 235.0764622169.
The spelling of 12990547 in words is "twelve million, nine hundred ninety thousand, five hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •