Base | Representation |
---|---|
bin | 1101001111101111001111… |
… | …1001110110101010110101 |
3 | 1220120022022101001202212212 |
4 | 3103323303321312222311 |
5 | 3402104113434204221 |
6 | 50550342404223205 |
7 | 3032134161212552 |
oct | 323736371665265 |
9 | 56508271052785 |
10 | 14564031163061 |
11 | 47056309a9666 |
12 | 177273469ab05 |
13 | 8184c7a41a93 |
14 | 384c8d68ba29 |
15 | 1a3c9d112b5b |
hex | d3ef3e76ab5 |
14564031163061 has 2 divisors, whose sum is σ = 14564031163062. Its totient is φ = 14564031163060.
The previous prime is 14564031163021. The next prime is 14564031163067. The reversal of 14564031163061 is 16036113046541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9443292124036 + 5120739039025 = 3072994^2 + 2262905^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14564031163061 is a prime.
It is a super-2 number, since 2×145640311630612 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14564031163067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7282015581530 + 7282015581531.
It is an arithmetic number, because the mean of its divisors is an integer number (7282015581531).
Almost surely, 214564031163061 is an apocalyptic number.
It is an amenable number.
14564031163061 is a deficient number, since it is larger than the sum of its proper divisors (1).
14564031163061 is an equidigital number, since it uses as much as digits as its factorization.
14564031163061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 155520, while the sum is 41.
The spelling of 14564031163061 in words is "fourteen trillion, five hundred sixty-four billion, thirty-one million, one hundred sixty-three thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •