Base | Representation |
---|---|
bin | 10101001000010001… |
… | …00010100010000101 |
3 | 1002021120001110001101 |
4 | 22210020202202011 |
5 | 141212432332423 |
6 | 5113341300101 |
7 | 551051214601 |
oct | 124410424205 |
9 | 32246043041 |
10 | 11343636613 |
11 | 48a12070a1 |
12 | 2246b64631 |
13 | 10ba19331a |
14 | 7987a2501 |
15 | 465d1c7ad |
hex | 2a4222885 |
11343636613 has 2 divisors, whose sum is σ = 11343636614. Its totient is φ = 11343636612.
The previous prime is 11343636589. The next prime is 11343636697. The reversal of 11343636613 is 31663634311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11138058369 + 205578244 = 105537^2 + 14338^2 .
It is a cyclic number.
It is not a de Polignac number, because 11343636613 - 25 = 11343636581 is a prime.
It is a super-2 number, since 2×113436366132 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11343634613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5671818306 + 5671818307.
It is an arithmetic number, because the mean of its divisors is an integer number (5671818307).
Almost surely, 211343636613 is an apocalyptic number.
It is an amenable number.
11343636613 is a deficient number, since it is larger than the sum of its proper divisors (1).
11343636613 is an equidigital number, since it uses as much as digits as its factorization.
11343636613 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 69984, while the sum is 37.
The spelling of 11343636613 in words is "eleven billion, three hundred forty-three million, six hundred thirty-six thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •