Base | Representation |
---|---|
bin | 110101100011… |
… | …100110100101 |
3 | 222102021112001 |
4 | 311203212211 |
5 | 12043230321 |
6 | 1220525301 |
7 | 230222242 |
oct | 65434645 |
9 | 28367461 |
10 | 14039461 |
11 | 7a1a067 |
12 | 4850831 |
13 | 2ba7397 |
14 | 1c165c9 |
15 | 1374c91 |
hex | d639a5 |
14039461 has 4 divisors (see below), whose sum is σ = 14778400. Its totient is φ = 13300524.
The previous prime is 14039447. The next prime is 14039471. The reversal of 14039461 is 16493041.
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: 16493041 = 191 ⋅86351.
It is a cyclic number.
It is not a de Polignac number, because 14039461 - 25 = 14039429 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 (14039471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 369441 + ... + 369478.
It is an arithmetic number, because the mean of its divisors is an integer number (3694600).
Almost surely, 214039461 is an apocalyptic number.
It is an amenable number.
14039461 is a deficient number, since it is larger than the sum of its proper divisors (738939).
14039461 is an equidigital number, since it uses as much as digits as its factorization.
14039461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 738938.
The product of its (nonzero) digits is 2592, while the sum is 28.
The square root of 14039461 is about 3746.9268741196. The cubic root of 14039461 is about 241.2404583374.
It can be divided in two parts, 140 and 39461, that added together give a square (39601 = 1992).
The spelling of 14039461 in words is "fourteen million, thirty-nine thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •