Base | Representation |
---|---|
bin | 101111110011… |
… | …101110110101 |
3 | 212120201120122 |
4 | 233303232311 |
5 | 11202021121 |
6 | 1124341325 |
7 | 211345241 |
oct | 57635665 |
9 | 25521518 |
10 | 12532661 |
11 | 708aa79 |
12 | 4244845 |
13 | 279a59b |
14 | 1943421 |
15 | 11785ab |
hex | bf3bb5 |
12532661 has 4 divisors (see below), whose sum is σ = 12573792. Its totient is φ = 12491532.
The previous prime is 12532643. The next prime is 12532673. The reversal of 12532661 is 16623521.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 16623521 = 3079 ⋅5399.
It is a cyclic number.
It is not a de Polignac number, because 12532661 - 210 = 12531637 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 12532661.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12532061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20105 + ... + 20718.
It is an arithmetic number, because the mean of its divisors is an integer number (3143448).
Almost surely, 212532661 is an apocalyptic number.
It is an amenable number.
12532661 is a deficient number, since it is larger than the sum of its proper divisors (41131).
12532661 is an equidigital number, since it uses as much as digits as its factorization.
12532661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41130.
The product of its digits is 2160, while the sum is 26.
The square root of 12532661 is about 3540.1498555852. The cubic root of 12532661 is about 232.2813977975.
The spelling of 12532661 in words is "twelve million, five hundred thirty-two thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •