Base | Representation |
---|---|
bin | 110011011001… |
… | …101011101101 |
3 | 221100120121002 |
4 | 303121223231 |
5 | 11422141131 |
6 | 1200450045 |
7 | 222350243 |
oct | 63315355 |
9 | 27316532 |
10 | 13474541 |
11 | 7673693 |
12 | 4619925 |
13 | 2a3a202 |
14 | 1b0a793 |
15 | 12b26cb |
hex | cd9aed |
13474541 has 4 divisors (see below), whose sum is σ = 13513500. Its totient is φ = 13435584.
The previous prime is 13474501. The next prime is 13474543. The reversal of 13474541 is 14547431.
It is a happy number.
13474541 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14547431 = 23 ⋅632497.
It can be written as a sum of positive squares in 2 ways, for example, as 6869641 + 6604900 = 2621^2 + 2570^2 .
It is a cyclic number.
It is not a de Polignac number, because 13474541 - 210 = 13473517 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13474543) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18956 + ... + 19653.
It is an arithmetic number, because the mean of its divisors is an integer number (3378375).
Almost surely, 213474541 is an apocalyptic number.
It is an amenable number.
13474541 is a deficient number, since it is larger than the sum of its proper divisors (38959).
13474541 is an equidigital number, since it uses as much as digits as its factorization.
13474541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38958.
The product of its digits is 6720, while the sum is 29.
The square root of 13474541 is about 3670.7684481590. The cubic root of 13474541 is about 237.9603834443.
The spelling of 13474541 in words is "thirteen million, four hundred seventy-four thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •