Base | Representation |
---|---|
bin | 1100111110010010100001… |
… | …1000010110010100001001 |
3 | 1212111122120002000001101221 |
4 | 3033210220120112110021 |
5 | 3332201203022032023 |
6 | 50200525022442041 |
7 | 3001362520202311 |
oct | 317445030262411 |
9 | 55448502001357 |
10 | 14264263861513 |
11 | 45aa493099136 |
12 | 1724615133321 |
13 | 7c61641a8783 |
14 | 374573400441 |
15 | 19b0a60bb85d |
hex | cf928616509 |
14264263861513 has 2 divisors, whose sum is σ = 14264263861514. Its totient is φ = 14264263861512.
The previous prime is 14264263861451. The next prime is 14264263861541. The reversal of 14264263861513 is 31516836246241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14214920791824 + 49343069689 = 3770268^2 + 222133^2 .
It is an emirp because it is prime and its reverse (31516836246241) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14264263861513 is a prime.
It is not a weakly prime, because it can be changed into another prime (14264263861313) 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, 7132131930756 + 7132131930757.
It is an arithmetic number, because the mean of its divisors is an integer number (7132131930757).
Almost surely, 214264263861513 is an apocalyptic number.
It is an amenable number.
14264263861513 is a deficient number, since it is larger than the sum of its proper divisors (1).
14264263861513 is an equidigital number, since it uses as much as digits as its factorization.
14264263861513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4976640, while the sum is 52.
The spelling of 14264263861513 in words is "fourteen trillion, two hundred sixty-four billion, two hundred sixty-three million, eight hundred sixty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •