Base | Representation |
---|---|
bin | 110000011010… |
… | …011011111101 |
3 | 212212210001100 |
4 | 300122123331 |
5 | 11222104242 |
6 | 1132003313 |
7 | 212605401 |
oct | 60323375 |
9 | 25783040 |
10 | 12691197 |
11 | 71890a2 |
12 | 4300539 |
13 | 28247ac |
14 | 1985101 |
15 | 11aa54c |
hex | c1a6fd |
12691197 has 24 divisors (see below), whose sum is σ = 19613880. Its totient is φ = 7879680.
The previous prime is 12691187. The next prime is 12691199. The reversal of 12691197 is 79119621.
12691197 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 933156 + 11758041 = 966^2 + 3429^2 .
It is not a de Polignac number, because 12691197 - 28 = 12690941 is a prime.
It is a super-2 number, since 2×126911972 = 322132962585618, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12691199) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 16297 + ... + 17057.
It is an arithmetic number, because the mean of its divisors is an integer number (817245).
Almost surely, 212691197 is an apocalyptic number.
12691197 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
12691197 is a deficient number, since it is larger than the sum of its proper divisors (6922683).
12691197 is a wasteful number, since it uses less digits than its factorization.
12691197 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 893 (or 890 counting only the distinct ones).
The product of its digits is 6804, while the sum is 36.
The square root of 12691197 is about 3562.4706314579. The cubic root of 12691197 is about 233.2567365362.
The spelling of 12691197 in words is "twelve million, six hundred ninety-one thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •