Base | Representation |
---|---|
bin | 110101111100… |
… | …010000000101 |
3 | 222121102000022 |
4 | 311330100011 |
5 | 12104443141 |
6 | 1223024525 |
7 | 231122501 |
oct | 65742005 |
9 | 28542008 |
10 | 14140421 |
11 | 7a889a9 |
12 | 489b145 |
13 | 2c11319 |
14 | 1c41301 |
15 | 1394b4b |
hex | d7c405 |
14140421 has 4 divisors (see below), whose sum is σ = 14469312. Its totient is φ = 13811532.
The previous prime is 14140411. The next prime is 14140439. The reversal of 14140421 is 12404141.
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.
It is a cyclic number.
It is not a de Polignac number, because 14140421 - 210 = 14139397 is a prime.
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 14140421.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14140411) 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, 164381 + ... + 164466.
It is an arithmetic number, because the mean of its divisors is an integer number (3617328).
Almost surely, 214140421 is an apocalyptic number.
It is an amenable number.
14140421 is a deficient number, since it is larger than the sum of its proper divisors (328891).
14140421 is an equidigital number, since it uses as much as digits as its factorization.
14140421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 328890.
The product of its (nonzero) digits is 128, while the sum is 17.
The square root of 14140421 is about 3760.3751142672. The cubic root of 14140421 is about 241.8173438994.
Adding to 14140421 its reverse (12404141), we get a palindrome (26544562).
The spelling of 14140421 in words is "fourteen million, one hundred forty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •