Base | Representation |
---|---|
bin | 110110101000… |
… | …101111010001 |
3 | 222221122222012 |
4 | 312220233101 |
5 | 12131311031 |
6 | 1230552305 |
7 | 232511654 |
oct | 66505721 |
9 | 28848865 |
10 | 14322641 |
11 | 80a28a3 |
12 | 4968695 |
13 | 2c76248 |
14 | 1c8b89b |
15 | 13cdb2b |
hex | da8bd1 |
14322641 has 2 divisors, whose sum is σ = 14322642. Its totient is φ = 14322640.
The previous prime is 14322601. The next prime is 14322643. The reversal of 14322641 is 14622341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13476241 + 846400 = 3671^2 + 920^2 .
It is an emirp because it is prime and its reverse (14622341) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14322641 - 26 = 14322577 is a prime.
It is a Sophie Germain prime.
Together with 14322643, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (14322643) 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, 7161320 + 7161321.
It is an arithmetic number, because the mean of its divisors is an integer number (7161321).
Almost surely, 214322641 is an apocalyptic number.
It is an amenable number.
14322641 is a deficient number, since it is larger than the sum of its proper divisors (1).
14322641 is an equidigital number, since it uses as much as digits as its factorization.
14322641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1152, while the sum is 23.
The square root of 14322641 is about 3784.5265225653. The cubic root of 14322641 is about 242.8516370971.
Adding to 14322641 its reverse (14622341), we get a palindrome (28944982).
The spelling of 14322641 in words is "fourteen million, three hundred twenty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •