Base | Representation |
---|---|
bin | 100000101100001010000… |
… | …001101011000101110101 |
3 | 21221202102222212011102222 |
4 | 200230022001223011311 |
5 | 243301200120402423 |
6 | 4435555402012125 |
7 | 321204531564056 |
oct | 40541201530565 |
9 | 7852388764388 |
10 | 2246436106613 |
11 | 7967876881a6 |
12 | 30345aaa7045 |
13 | 133ab81757ba |
14 | 7aa29c3072d |
15 | 3d67ceb83c8 |
hex | 20b0a06b175 |
2246436106613 has 12 divisors (see below), whose sum is σ = 2392487244420. Its totient is φ = 2108857500672.
The previous prime is 2246436106513. The next prime is 2246436106657. The reversal of 2246436106613 is 3166016346422.
It can be written as a sum of positive squares in 6 ways, for example, as 42274238449 + 2204161868164 = 205607^2 + 1484642^2 .
It is not a de Polignac number, because 2246436106613 - 224 = 2246419329397 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2246436106513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9878756 + ... + 10103597.
It is an arithmetic number, because the mean of its divisors is an integer number (199373937035).
Almost surely, 22246436106613 is an apocalyptic number.
It is an amenable number.
2246436106613 is a deficient number, since it is larger than the sum of its proper divisors (146051137807).
2246436106613 is a wasteful number, since it uses less digits than its factorization.
2246436106613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19982776 (or 19982759 counting only the distinct ones).
The product of its (nonzero) digits is 746496, while the sum is 44.
The spelling of 2246436106613 in words is "two trillion, two hundred forty-six billion, four hundred thirty-six million, one hundred six thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •