Base | Representation |
---|---|
bin | 110100000011… |
… | …000101011111 |
3 | 221200012020001 |
4 | 310003011133 |
5 | 11443103002 |
6 | 1204235131 |
7 | 223654540 |
oct | 64030537 |
9 | 27605201 |
10 | 13644127 |
11 | 777a042 |
12 | 469baa7 |
13 | 2a99463 |
14 | 1b524c7 |
15 | 12e7a87 |
hex | d0315f |
13644127 has 4 divisors (see below), whose sum is σ = 15593296. Its totient is φ = 11694960.
The previous prime is 13644107. The next prime is 13644133. The reversal of 13644127 is 72144631.
13644127 is digitally balanced in base 2, 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: 72144631 = 13 ⋅5549587.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13644127 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13644095 and 13644104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13644107) 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, 974574 + ... + 974587.
It is an arithmetic number, because the mean of its divisors is an integer number (3898324).
Almost surely, 213644127 is an apocalyptic number.
13644127 is a deficient number, since it is larger than the sum of its proper divisors (1949169).
13644127 is an equidigital number, since it uses as much as digits as its factorization.
13644127 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1949168.
The product of its digits is 4032, while the sum is 28.
The square root of 13644127 is about 3693.7957442176. The cubic root of 13644127 is about 238.9545206204.
Adding to 13644127 its reverse (72144631), we get a palindrome (85788758).
The spelling of 13644127 in words is "thirteen million, six hundred forty-four thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •