Base | Representation |
---|---|
bin | 11111000101111001111… |
… | …110111111110100111101 |
3 | 21120021001111002111101221 |
4 | 133011321332333310331 |
5 | 240001322144203423 |
6 | 4313321124033341 |
7 | 310240030264312 |
oct | 37057176776475 |
9 | 7507044074357 |
10 | 2136645303613 |
11 | 754167631977 |
12 | 2a611a232851 |
13 | 12663c103102 |
14 | 755b2744d09 |
15 | 3a8a4444e5d |
hex | 1f179fbfd3d |
2136645303613 has 2 divisors, whose sum is σ = 2136645303614. Its totient is φ = 2136645303612.
The previous prime is 2136645303571. The next prime is 2136645303619. The reversal of 2136645303613 is 3163035466312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1157855625369 + 978789678244 = 1076037^2 + 989338^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2136645303613 is a prime.
It is a super-4 number, since 4×21366453036134 (a number of 50 digits) contains 4444 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2136645303613.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2136645303619) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1068322651806 + 1068322651807.
It is an arithmetic number, because the mean of its divisors is an integer number (1068322651807).
Almost surely, 22136645303613 is an apocalyptic number.
It is an amenable number.
2136645303613 is a deficient number, since it is larger than the sum of its proper divisors (1).
2136645303613 is an equidigital number, since it uses as much as digits as its factorization.
2136645303613 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 699840, while the sum is 43.
The spelling of 2136645303613 in words is "two trillion, one hundred thirty-six billion, six hundred forty-five million, three hundred three thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •