Base | Representation |
---|---|
bin | 110111001110… |
… | …101100101101 |
3 | 1000020120020212 |
4 | 313032230231 |
5 | 12201300000 |
6 | 1234152205 |
7 | 234030164 |
oct | 67165455 |
9 | 30216225 |
10 | 14478125 |
11 | 81996a2 |
12 | 4a22665 |
13 | 2ccbc4c |
14 | 1ccc3db |
15 | 140ec35 |
hex | dceb2d |
14478125 has 24 divisors (see below), whose sum is σ = 18701928. Its totient is φ = 11200000.
The previous prime is 14478119. The next prime is 14478131. The reversal of 14478125 is 52187441.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (14478119) and next prime (14478131).
It can be written as a sum of positive squares in 12 ways, for example, as 10259209 + 4218916 = 3203^2 + 2054^2 .
It is not a de Polignac number, because 14478125 - 216 = 14412589 is a prime.
It is a super-2 number, since 2×144781252 = 419232207031250, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 14478091 and 14478100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 128069 + ... + 128181.
It is an arithmetic number, because the mean of its divisors is an integer number (779247).
Almost surely, 214478125 is an apocalyptic number.
It is an amenable number.
14478125 is a deficient number, since it is larger than the sum of its proper divisors (4223803).
14478125 is an frugal number, since it uses more digits than its factorization.
14478125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179 (or 159 counting only the distinct ones).
The product of its digits is 8960, while the sum is 32.
The square root of 14478125 is about 3805.0131405818. The cubic root of 14478125 is about 243.7272606444.
The spelling of 14478125 in words is "fourteen million, four hundred seventy-eight thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •