Base | Representation |
---|---|
bin | 110110101001… |
… | …010110101001 |
3 | 222221210102112 |
4 | 312221112221 |
5 | 12131401121 |
6 | 1231012105 |
7 | 232522214 |
oct | 66512651 |
9 | 28853375 |
10 | 14325161 |
11 | 80a4784 |
12 | 496a035 |
13 | 2c77436 |
14 | 1c8c77b |
15 | 13ce75b |
hex | da95a9 |
14325161 has 2 divisors, whose sum is σ = 14325162. Its totient is φ = 14325160.
The previous prime is 14325119. The next prime is 14325167. The reversal of 14325161 is 16152341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13987600 + 337561 = 3740^2 + 581^2 .
It is an emirp because it is prime and its reverse (16152341) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14325161 - 26 = 14325097 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (14325167) 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, 7162580 + 7162581.
It is an arithmetic number, because the mean of its divisors is an integer number (7162581).
Almost surely, 214325161 is an apocalyptic number.
It is an amenable number.
14325161 is a deficient number, since it is larger than the sum of its proper divisors (1).
14325161 is an equidigital number, since it uses as much as digits as its factorization.
14325161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 720, while the sum is 23.
The square root of 14325161 is about 3784.8594425685. The cubic root of 14325161 is about 242.8658791222.
The spelling of 14325161 in words is "fourteen million, three hundred twenty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •