Base | Representation |
---|---|
bin | 110000101101… |
… | …100101000101 |
3 | 220000202121100 |
4 | 300231211011 |
5 | 11232111410 |
6 | 1133410313 |
7 | 213353112 |
oct | 60554505 |
9 | 26022540 |
10 | 12769605 |
11 | 7231aa2 |
12 | 4339999 |
13 | 28513a4 |
14 | 19a5909 |
15 | 11c38c0 |
hex | c2d945 |
12769605 has 12 divisors (see below), whose sum is σ = 22134060. Its totient is φ = 6810432.
The previous prime is 12769591. The next prime is 12769607. The reversal of 12769605 is 50696721.
It can be written as a sum of positive squares in 2 ways, for example, as 1520289 + 11249316 = 1233^2 + 3354^2 .
It is not a de Polignac number, because 12769605 - 29 = 12769093 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12769605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12769607) 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 11 ways as a sum of consecutive naturals, for example, 141840 + ... + 141929.
It is an arithmetic number, because the mean of its divisors is an integer number (1844505).
Almost surely, 212769605 is an apocalyptic number.
12769605 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12769605 is a deficient number, since it is larger than the sum of its proper divisors (9364455).
12769605 is a wasteful number, since it uses less digits than its factorization.
12769605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283780 (or 283777 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 36.
The square root of 12769605 is about 3573.4584088807. The cubic root of 12769605 is about 233.7361149730.
The spelling of 12769605 in words is "twelve million, seven hundred sixty-nine thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •