Base | Representation |
---|---|
bin | 110001101111… |
… | …100111111101 |
3 | 220112111200121 |
4 | 301233213331 |
5 | 11314241000 |
6 | 1143254541 |
7 | 215560600 |
oct | 61574775 |
9 | 26474617 |
10 | 13040125 |
11 | 73a726a |
12 | 444a451 |
13 | 2917567 |
14 | 1a36337 |
15 | 1228b1a |
hex | c6f9fd |
13040125 has 24 divisors (see below), whose sum is σ = 18939960. Its totient is φ = 8937600.
The previous prime is 13040123. The next prime is 13040141. The reversal of 13040125 is 52104031.
It can be written as a sum of positive squares in 4 ways, for example, as 1466521 + 11573604 = 1211^2 + 3402^2 .
It is not a de Polignac number, because 13040125 - 21 = 13040123 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13040099 and 13040108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13040123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5061 + ... + 7189.
It is an arithmetic number, because the mean of its divisors is an integer number (789165).
Almost surely, 213040125 is an apocalyptic number.
It is an amenable number.
13040125 is a deficient number, since it is larger than the sum of its proper divisors (5899835).
13040125 is an equidigital number, since it uses as much as digits as its factorization.
13040125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2158 (or 2141 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 13040125 is about 3611.1113247863. Note that the first 3 decimals coincide. The cubic root of 13040125 is about 235.3751364685.
Adding to 13040125 its reverse (52104031), we get a palindrome (65144156).
The spelling of 13040125 in words is "thirteen million, forty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •