Base | Representation |
---|---|
bin | 110101011111… |
… | …110111001101 |
3 | 222101111111122 |
4 | 311133313031 |
5 | 12042233031 |
6 | 1220330325 |
7 | 230126465 |
oct | 65376715 |
9 | 28344448 |
10 | 14024141 |
11 | 7a095aa |
12 | 48439a5 |
13 | 2ba0411 |
14 | 1c10ba5 |
15 | 137047b |
hex | d5fdcd |
14024141 has 4 divisors (see below), whose sum is σ = 14036832. Its totient is φ = 14011452.
The previous prime is 14024117. The next prime is 14024161. The reversal of 14024141 is 14142041.
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: 14142041 = 3491 ⋅4051.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14024141 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 (14024161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4511 + ... + 6956.
It is an arithmetic number, because the mean of its divisors is an integer number (3509208).
Almost surely, 214024141 is an apocalyptic number.
It is an amenable number.
14024141 is a deficient number, since it is larger than the sum of its proper divisors (12691).
14024141 is a wasteful number, since it uses less digits than its factorization.
14024141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12690.
The product of its (nonzero) digits is 128, while the sum is 17.
The square root of 14024141 is about 3744.8819741081. The cubic root of 14024141 is about 241.1526784021.
Adding to 14024141 its reverse (14142041), we get a palindrome (28166182).
The spelling of 14024141 in words is "fourteen million, twenty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •