Base | Representation |
---|---|
bin | 110111001011… |
… | …001010011001 |
3 | 1000012211101102 |
4 | 313023022121 |
5 | 12200314031 |
6 | 1234001145 |
7 | 233640023 |
oct | 67131231 |
9 | 30184342 |
10 | 14463641 |
11 | 8189825 |
12 | 4a161b5 |
13 | 2cc548a |
14 | 1cc7013 |
15 | 140a7cb |
hex | dcb299 |
14463641 has 2 divisors, whose sum is σ = 14463642. Its totient is φ = 14463640.
The previous prime is 14463599. The next prime is 14463653. The reversal of 14463641 is 14636441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14137600 + 326041 = 3760^2 + 571^2 .
It is a cyclic number.
It is not a de Polignac number, because 14463641 - 218 = 14201497 is a prime.
It is a Chen prime.
It is equal to p938270 and since 14463641 and 938270 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (14463671) 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 as a sum of consecutive naturals, namely, 7231820 + 7231821.
It is an arithmetic number, because the mean of its divisors is an integer number (7231821).
Almost surely, 214463641 is an apocalyptic number.
It is an amenable number.
14463641 is a deficient number, since it is larger than the sum of its proper divisors (1).
14463641 is an equidigital number, since it uses as much as digits as its factorization.
14463641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6912, while the sum is 29.
The square root of 14463641 is about 3803.1093857527. The cubic root of 14463641 is about 243.6459581394.
The spelling of 14463641 in words is "fourteen million, four hundred sixty-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •