Base | Representation |
---|---|
bin | 110000001111… |
… | …010010110101 |
3 | 212210110102222 |
4 | 300033102311 |
5 | 11214124212 |
6 | 1131012125 |
7 | 212325341 |
oct | 60172265 |
9 | 25713388 |
10 | 12645557 |
11 | 7157881 |
12 | 429a045 |
13 | 2809aa2 |
14 | 1972621 |
15 | 119bc72 |
hex | c0f4b5 |
12645557 has 4 divisors (see below), whose sum is σ = 12657996. Its totient is φ = 12633120.
The previous prime is 12645547. The next prime is 12645623. The reversal of 12645557 is 75554621.
12645557 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 749956 + 11895601 = 866^2 + 3449^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12645557 is a prime.
It is a super-2 number, since 2×126455572 = 319820223680498, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12645547) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4544 + ... + 6777.
It is an arithmetic number, because the mean of its divisors is an integer number (3164499).
Almost surely, 212645557 is an apocalyptic number.
It is an amenable number.
12645557 is a deficient number, since it is larger than the sum of its proper divisors (12439).
12645557 is a wasteful number, since it uses less digits than its factorization.
12645557 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12438.
The product of its digits is 42000, while the sum is 35.
The square root of 12645557 is about 3556.0591952328. The cubic root of 12645557 is about 232.9767885662.
The spelling of 12645557 in words is "twelve million, six hundred forty-five thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.036 sec. • engine limits •