Base | Representation |
---|---|
bin | 110110011000… |
… | …001010010101 |
3 | 222211012211101 |
4 | 312120022111 |
5 | 12122122431 |
6 | 1225310101 |
7 | 232110004 |
oct | 66301225 |
9 | 28735741 |
10 | 14254741 |
11 | 8056886 |
12 | 4935331 |
13 | 2c51377 |
14 | 1c70c3b |
15 | 13b8961 |
hex | d98295 |
14254741 has 4 divisors (see below), whose sum is σ = 14455584. Its totient is φ = 14053900.
The previous prime is 14254739. The next prime is 14254753. The reversal of 14254741 is 14745241.
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: 14745241 = 7 ⋅2106463.
It is a cyclic number.
It is not a de Polignac number, because 14254741 - 21 = 14254739 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 (14254711) 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, 100315 + ... + 100456.
It is an arithmetic number, because the mean of its divisors is an integer number (3613896).
Almost surely, 214254741 is an apocalyptic number.
It is an amenable number.
14254741 is a deficient number, since it is larger than the sum of its proper divisors (200843).
14254741 is an equidigital number, since it uses as much as digits as its factorization.
14254741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200842.
The product of its digits is 4480, while the sum is 28.
The square root of 14254741 is about 3775.5451262036. The cubic root of 14254741 is about 242.4672630906.
Adding to 14254741 its reverse (14745241), we get a palindrome (28999982).
The spelling of 14254741 in words is "fourteen million, two hundred fifty-four thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •