Base | Representation |
---|---|
bin | 110000101101… |
… | …110000111101 |
3 | 220000210122111 |
4 | 300231300331 |
5 | 11232122430 |
6 | 1133414021 |
7 | 213355246 |
oct | 60556075 |
9 | 26023574 |
10 | 12770365 |
11 | 7232623 |
12 | 433a311 |
13 | 285183a |
14 | 19a5ccd |
15 | 11c3c2a |
hex | c2dc3d |
12770365 has 8 divisors (see below), whose sum is σ = 15738840. Its totient is φ = 9940032.
The previous prime is 12770363. The next prime is 12770377. The reversal of 12770365 is 56307721.
12770365 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 2292196 + 10478169 = 1514^2 + 3237^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12770365 - 21 = 12770363 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12770363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34330 + ... + 34699.
It is an arithmetic number, because the mean of its divisors is an integer number (1967355).
Almost surely, 212770365 is an apocalyptic number.
It is an amenable number.
12770365 is a deficient number, since it is larger than the sum of its proper divisors (2968475).
12770365 is an equidigital number, since it uses as much as digits as its factorization.
12770365 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69071.
The product of its (nonzero) digits is 8820, while the sum is 31.
The square root of 12770365 is about 3573.5647468599. The cubic root of 12770365 is about 233.7407519195.
The spelling of 12770365 in words is "twelve million, seven hundred seventy thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.189 sec. • engine limits •