Base | Representation |
---|---|
bin | 110000000010… |
… | …011111100101 |
3 | 212200210112001 |
4 | 300002133211 |
5 | 11210440000 |
6 | 1125525301 |
7 | 212016436 |
oct | 60023745 |
9 | 25623461 |
10 | 12593125 |
11 | 7121446 |
12 | 4273831 |
13 | 27bbc6c |
14 | 195b48d |
15 | 118b46a |
hex | c027e5 |
12593125 has 10 divisors (see below), whose sum is σ = 15737150. Its totient is φ = 10074000.
The previous prime is 12593123. The next prime is 12593129. The reversal of 12593125 is 52139521.
12593125 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 5 ways, for example, as 5189284 + 7403841 = 2278^2 + 2721^2 .
It is not a de Polignac number, because 12593125 - 21 = 12593123 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12593093 and 12593102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12593123) 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 9 ways as a sum of consecutive naturals, for example, 9450 + ... + 10699.
It is an arithmetic number, because the mean of its divisors is an integer number (1573715).
Almost surely, 212593125 is an apocalyptic number.
It is an amenable number.
12593125 is a deficient number, since it is larger than the sum of its proper divisors (3144025).
12593125 is an frugal number, since it uses more digits than its factorization.
12593125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20169 (or 20154 counting only the distinct ones).
The product of its digits is 2700, while the sum is 28.
The square root of 12593125 is about 3548.6793318078. The cubic root of 12593125 is about 232.6543469675.
The spelling of 12593125 in words is "twelve million, five hundred ninety-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •