Base | Representation |
---|---|
bin | 1100100111101110100010… |
… | …0110000011101111100001 |
3 | 1211010121001100211212102221 |
4 | 3021323220212003233201 |
5 | 3304323333021010433 |
6 | 45302502104511041 |
7 | 2631361145262661 |
oct | 311735046035741 |
9 | 54117040755387 |
10 | 13876646656993 |
11 | 447006430230a |
12 | 1681478a7b481 |
13 | 7987400cb663 |
14 | 35d8c1a221a1 |
15 | 190e6b85972d |
hex | c9ee8983be1 |
13876646656993 has 2 divisors, whose sum is σ = 13876646656994. Its totient is φ = 13876646656992.
The previous prime is 13876646656987. The next prime is 13876646657021. The reversal of 13876646656993 is 39965664667831.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13833512351649 + 43134305344 = 3719343^2 + 207688^2 .
It is a cyclic number.
It is not a de Polignac number, because 13876646656993 - 213 = 13876646648801 is a prime.
It is a super-2 number, since 2×138766466569932 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13876646656913) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6938323328496 + 6938323328497.
It is an arithmetic number, because the mean of its divisors is an integer number (6938323328497).
Almost surely, 213876646656993 is an apocalyptic number.
It is an amenable number.
13876646656993 is a deficient number, since it is larger than the sum of its proper divisors (1).
13876646656993 is an equidigital number, since it uses as much as digits as its factorization.
13876646656993 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6348948480, while the sum is 79.
The spelling of 13876646656993 in words is "thirteen trillion, eight hundred seventy-six billion, six hundred forty-six million, six hundred fifty-six thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •