Base | Representation |
---|---|
bin | 110110101000… |
… | …100101100001 |
3 | 222221122010002 |
4 | 312220211201 |
5 | 12131301032 |
6 | 1230545345 |
7 | 232510103 |
oct | 66504541 |
9 | 28848102 |
10 | 14322017 |
11 | 80a2386 |
12 | 4968255 |
13 | 2c75b88 |
14 | 1c8b573 |
15 | 13cd862 |
hex | da8961 |
14322017 has 2 divisors, whose sum is σ = 14322018. Its totient is φ = 14322016.
The previous prime is 14322013. The next prime is 14322019. The reversal of 14322017 is 71022341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9928801 + 4393216 = 3151^2 + 2096^2 .
It is a cyclic number.
It is not a de Polignac number, because 14322017 - 22 = 14322013 is a prime.
Together with 14322019, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14322017.
It is not a weakly prime, because it can be changed into another prime (14322013) 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 as a sum of consecutive naturals, namely, 7161008 + 7161009.
It is an arithmetic number, because the mean of its divisors is an integer number (7161009).
Almost surely, 214322017 is an apocalyptic number.
It is an amenable number.
14322017 is a deficient number, since it is larger than the sum of its proper divisors (1).
14322017 is an equidigital number, since it uses as much as digits as its factorization.
14322017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 20.
The square root of 14322017 is about 3784.4440807072. Note that the first 3 decimals coincide. The cubic root of 14322017 is about 242.8481102424.
Adding to 14322017 its reverse (71022341), we get a palindrome (85344358).
The spelling of 14322017 in words is "fourteen million, three hundred twenty-two thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •