Base | Representation |
---|---|
bin | 1100011001110000011110… |
… | …1100010001110100100001 |
3 | 1210021122120121012021212201 |
4 | 3012130013230101310201 |
5 | 3241410324423301031 |
6 | 45000331324053201 |
7 | 2605133622204331 |
oct | 306340754216441 |
9 | 53248517167781 |
10 | 13636650212641 |
11 | 43882a85a1525 |
12 | 1642a5a694201 |
13 | 77bc136a3481 |
14 | 352035a1b0c1 |
15 | 189ac1da1d61 |
hex | c6707b11d21 |
13636650212641 has 12 divisors (see below), whose sum is σ = 13777827402276. Its totient is φ = 13496200143360.
The previous prime is 13636650212611. The next prime is 13636650212687. The reversal of 13636650212641 is 14621205663631.
It can be written as a sum of positive squares in 2 ways, for example, as 11587243232016 + 2049406980625 = 3404004^2 + 1431575^2 .
It is not a de Polignac number, because 13636650212641 - 225 = 13636616658209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13636650212591 and 13636650212600.
It is not an unprimeable number, because it can be changed into a prime (13636650212611) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14555601 + ... + 15464113.
It is an arithmetic number, because the mean of its divisors is an integer number (1148152283523).
Almost surely, 213636650212641 is an apocalyptic number.
It is an amenable number.
13636650212641 is a deficient number, since it is larger than the sum of its proper divisors (141177189635).
13636650212641 is an frugal number, since it uses more digits than its factorization.
13636650212641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 909312 (or 908981 counting only the distinct ones).
The product of its (nonzero) digits is 933120, while the sum is 46.
The spelling of 13636650212641 in words is "thirteen trillion, six hundred thirty-six billion, six hundred fifty million, two hundred twelve thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •