Base | Representation |
---|---|
bin | 110111000010… |
… | …001011001001 |
3 | 1000010221212212 |
4 | 313002023021 |
5 | 12143124300 |
6 | 1233114505 |
7 | 233424500 |
oct | 67021311 |
9 | 30127785 |
10 | 14426825 |
11 | 81640a6 |
12 | 49b8a35 |
13 | 2cb17aa |
14 | 1cb7837 |
15 | 13ee935 |
hex | dc22c9 |
14426825 has 18 divisors (see below), whose sum is σ = 20811726. Its totient is φ = 9891840.
The previous prime is 14426813. The next prime is 14426827. The reversal of 14426825 is 52862441.
It can be written as a sum of positive squares in 3 ways, for example, as 1731856 + 12694969 = 1316^2 + 3563^2 .
It is not a de Polignac number, because 14426825 - 24 = 14426809 is a prime.
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 = 14426791 and 14426800.
It is not an unprimeable number, because it can be changed into a prime (14426827) 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 17 ways as a sum of consecutive naturals, for example, 4664 + ... + 7113.
It is an arithmetic number, because the mean of its divisors is an integer number (1156207).
Almost surely, 214426825 is an apocalyptic number.
It is an amenable number.
14426825 is a deficient number, since it is larger than the sum of its proper divisors (6384901).
14426825 is a wasteful number, since it uses less digits than its factorization.
14426825 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11801 (or 11789 counting only the distinct ones).
The product of its digits is 15360, while the sum is 32.
The square root of 14426825 is about 3798.2660517663. The cubic root of 14426825 is about 243.4390556213.
It can be divided in two parts, 14426 and 825, that added together give a palindrome (15251).
The spelling of 14426825 in words is "fourteen million, four hundred twenty-six thousand, eight hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •