Base | Representation |
---|---|
bin | 110011001101… |
… | …010111101111 |
3 | 221021000102022 |
4 | 303031113233 |
5 | 11414032421 |
6 | 1155420355 |
7 | 222050231 |
oct | 63152757 |
9 | 27230368 |
10 | 13424111 |
11 | 7639808 |
12 | 45b46bb |
13 | 2a2027c |
14 | 1ad6251 |
15 | 12a27ab |
hex | ccd5ef |
13424111 has 4 divisors (see below), whose sum is σ = 14007792. Its totient is φ = 12840432.
The previous prime is 13424107. The next prime is 13424119. The reversal of 13424111 is 11142431.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11142431 = 47 ⋅237073.
It is a cyclic number.
It is not a de Polignac number, because 13424111 - 22 = 13424107 is a prime.
It is a super-2 number, since 2×134241112 = 360413512280642, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13424111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13424119) 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, 291806 + ... + 291851.
It is an arithmetic number, because the mean of its divisors is an integer number (3501948).
Almost surely, 213424111 is an apocalyptic number.
13424111 is a deficient number, since it is larger than the sum of its proper divisors (583681).
13424111 is an equidigital number, since it uses as much as digits as its factorization.
13424111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 583680.
The product of its digits is 96, while the sum is 17.
The square root of 13424111 is about 3663.8928750715. The cubic root of 13424111 is about 237.6631477358.
Adding to 13424111 its reverse (11142431), we get a palindrome (24566542).
The spelling of 13424111 in words is "thirteen million, four hundred twenty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •