Base | Representation |
---|---|
bin | 11011010001011001… |
… | …11111010110010001 |
3 | 1101210101121121000201 |
4 | 31220230333112101 |
5 | 214441212314121 |
6 | 10420510415201 |
7 | 1025554630123 |
oct | 155054772621 |
9 | 41711547021 |
10 | 14641526161 |
11 | 623383a349 |
12 | 2a07501501 |
13 | 14c44b6b62 |
14 | 9cc78d213 |
15 | 5aa604e91 |
hex | 368b3f591 |
14641526161 has 2 divisors, whose sum is σ = 14641526162. Its totient is φ = 14641526160.
The previous prime is 14641526087. The next prime is 14641526171. The reversal of 14641526161 is 16162514641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13097429136 + 1544097025 = 114444^2 + 39295^2 .
It is a cyclic number.
It is not a de Polignac number, because 14641526161 - 223 = 14633137553 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14641526161.
It is not a weakly prime, because it can be changed into another prime (14641526171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7320763080 + 7320763081.
It is an arithmetic number, because the mean of its divisors is an integer number (7320763081).
Almost surely, 214641526161 is an apocalyptic number.
It is an amenable number.
14641526161 is a deficient number, since it is larger than the sum of its proper divisors (1).
14641526161 is an equidigital number, since it uses as much as digits as its factorization.
14641526161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 34560, while the sum is 37.
The spelling of 14641526161 in words is "fourteen billion, six hundred forty-one million, five hundred twenty-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •