Base | Representation |
---|---|
bin | 110110001100… |
… | …111000011101 |
3 | 222201212110021 |
4 | 312030320131 |
5 | 12114133131 |
6 | 1224312141 |
7 | 231525214 |
oct | 66147035 |
9 | 28655407 |
10 | 14208541 |
11 | 80250a6 |
12 | 4912651 |
13 | 2c36329 |
14 | 1c5c07b |
15 | 13a9e11 |
hex | d8ce1d |
14208541 has 4 divisors (see below), whose sum is σ = 14346592. Its totient is φ = 14070492.
The previous prime is 14208539. The next prime is 14208553. The reversal of 14208541 is 14580241.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 14580241 = 13 ⋅1121557.
It is a cyclic number.
It is not a de Polignac number, because 14208541 - 21 = 14208539 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 (14200541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 68871 + ... + 69076.
It is an arithmetic number, because the mean of its divisors is an integer number (3586648).
Almost surely, 214208541 is an apocalyptic number.
It is an amenable number.
14208541 is a deficient number, since it is larger than the sum of its proper divisors (138051).
14208541 is a wasteful number, since it uses less digits than its factorization.
14208541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138050.
The product of its (nonzero) digits is 1280, while the sum is 25.
The square root of 14208541 is about 3769.4218389562. The cubic root of 14208541 is about 242.2050319407.
Adding to 14208541 its reverse (14580241), we get a palindrome (28788782).
The spelling of 14208541 in words is "fourteen million, two hundred eight thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •