Base | Representation |
---|---|
bin | 1011011000010000101111… |
… | …0111001110011010000001 |
3 | 1122022002012200100000020012 |
4 | 2312010023313032122001 |
5 | 3114441411310301203 |
6 | 42335401533354305 |
7 | 2430631054520156 |
oct | 266041367163201 |
9 | 48262180300205 |
10 | 12511438759553 |
11 | 3a94087009698 |
12 | 14a0973638995 |
13 | 6c9a92627626 |
14 | 3137b208622d |
15 | 16a6b7db0bd8 |
hex | b610bdce681 |
12511438759553 has 2 divisors, whose sum is σ = 12511438759554. Its totient is φ = 12511438759552.
The previous prime is 12511438759517. The next prime is 12511438759613. The reversal of 12511438759553 is 35595783411521.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12236514713329 + 274924046224 = 3498073^2 + 524332^2 .
It is a cyclic number.
It is not a de Polignac number, because 12511438759553 - 220 = 12511437710977 is a prime.
It is a super-2 number, since 2×125114387595532 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12511438759492 and 12511438759501.
It is not a weakly prime, because it can be changed into another prime (12511438759513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6255719379776 + 6255719379777.
It is an arithmetic number, because the mean of its divisors is an integer number (6255719379777).
Almost surely, 212511438759553 is an apocalyptic number.
It is an amenable number.
12511438759553 is a deficient number, since it is larger than the sum of its proper divisors (1).
12511438759553 is an equidigital number, since it uses as much as digits as its factorization.
12511438759553 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 22680000, while the sum is 59.
The spelling of 12511438759553 in words is "twelve trillion, five hundred eleven billion, four hundred thirty-eight million, seven hundred fifty-nine thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •