Base | Representation |
---|---|
bin | 101111110000… |
… | …110100010101 |
3 | 212120010012120 |
4 | 233300310111 |
5 | 11201130400 |
6 | 1124210153 |
7 | 211265400 |
oct | 57606425 |
9 | 25503176 |
10 | 12520725 |
11 | 7082008 |
12 | 4239959 |
13 | 2795019 |
14 | 193cd37 |
15 | 1174ca0 |
hex | bf0d15 |
12520725 has 36 divisors (see below), whose sum is σ = 24087744. Its totient is φ = 5722080.
The previous prime is 12520723. The next prime is 12520747. The reversal of 12520725 is 52702521.
12520725 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12520725 - 21 = 12520723 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12520695 and 12520704.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12520723) 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 35 ways as a sum of consecutive naturals, for example, 1972 + ... + 5378.
It is an arithmetic number, because the mean of its divisors is an integer number (669104).
Almost surely, 212520725 is an apocalyptic number.
12520725 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12520725 is a deficient number, since it is larger than the sum of its proper divisors (11567019).
12520725 is a wasteful number, since it uses less digits than its factorization.
12520725 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3434 (or 3422 counting only the distinct ones).
The product of its (nonzero) digits is 1400, while the sum is 24.
The square root of 12520725 is about 3538.4636496649. The cubic root of 12520725 is about 232.2076334308.
The spelling of 12520725 in words is "twelve million, five hundred twenty thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •