Base | Representation |
---|---|
bin | 1011100010101101110011… |
… | …1111100011001111110101 |
3 | 1122221020210110201010220221 |
4 | 2320223130333203033311 |
5 | 3130412223001224344 |
6 | 42554103405454341 |
7 | 2446616553642151 |
oct | 270533477431765 |
9 | 48836713633827 |
10 | 12691041039349 |
11 | 40532708a2792 |
12 | 150b737b713b1 |
13 | 7109b5a4817a |
14 | 31c36d112061 |
15 | 1701ca706184 |
hex | b8adcfe33f5 |
12691041039349 has 2 divisors, whose sum is σ = 12691041039350. Its totient is φ = 12691041039348.
The previous prime is 12691041039311. The next prime is 12691041039361. The reversal of 12691041039349 is 94393014019621.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8024857821124 + 4666183218225 = 2832818^2 + 2160135^2 .
It is a cyclic number.
It is not a de Polignac number, because 12691041039349 - 219 = 12691040515061 is a prime.
It is a super-2 number, since 2×126910410393492 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12691041039296 and 12691041039305.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12691041039749) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6345520519674 + 6345520519675.
It is an arithmetic number, because the mean of its divisors is an integer number (6345520519675).
Almost surely, 212691041039349 is an apocalyptic number.
It is an amenable number.
12691041039349 is a deficient number, since it is larger than the sum of its proper divisors (1).
12691041039349 is an equidigital number, since it uses as much as digits as its factorization.
12691041039349 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1259712, while the sum is 52.
The spelling of 12691041039349 in words is "twelve trillion, six hundred ninety-one billion, forty-one million, thirty-nine thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •