Base | Representation |
---|---|
bin | 110101001100… |
… | …011000101001 |
3 | 222020110001211 |
4 | 311030120221 |
5 | 12032204421 |
6 | 1214513121 |
7 | 226345054 |
oct | 65143051 |
9 | 28213054 |
10 | 13944361 |
11 | 7964672 |
12 | 48057a1 |
13 | 2b73002 |
14 | 1bcda9b |
15 | 13569e1 |
hex | d4c629 |
13944361 has 4 divisors (see below), whose sum is σ = 13959424. Its totient is φ = 13929300.
The previous prime is 13944349. The next prime is 13944367. The reversal of 13944361 is 16344931.
13944361 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 a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 16344931 = 101 ⋅161831.
It is a cyclic number.
It is not a de Polignac number, because 13944361 - 29 = 13943849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13944367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6045 + ... + 8026.
It is an arithmetic number, because the mean of its divisors is an integer number (3489856).
Almost surely, 213944361 is an apocalyptic number.
It is an amenable number.
13944361 is a deficient number, since it is larger than the sum of its proper divisors (15063).
13944361 is an equidigital number, since it uses as much as digits as its factorization.
13944361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15062.
The product of its digits is 7776, while the sum is 31.
The square root of 13944361 is about 3734.2149107945. The cubic root of 13944361 is about 240.6945217906.
The spelling of 13944361 in words is "thirteen million, nine hundred forty-four thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •