Base | Representation |
---|---|
bin | 1010000000101010111010… |
… | …1001000010011000101101 |
3 | 1102222020001101211212000111 |
4 | 2200022232221002120231 |
5 | 2420313042332034423 |
6 | 35224213500300021 |
7 | 2214126464043466 |
oct | 240125651023055 |
9 | 42866041755014 |
10 | 11006636205613 |
11 | 3563985217464 |
12 | 12991b0241611 |
13 | 61abc9254139 |
14 | 2a0a1ca73d6d |
15 | 1414940b260d |
hex | a02aea4262d |
11006636205613 has 2 divisors, whose sum is σ = 11006636205614. Its totient is φ = 11006636205612.
The previous prime is 11006636205533. The next prime is 11006636205647. The reversal of 11006636205613 is 31650263660011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7447293634729 + 3559342570884 = 2728973^2 + 1886622^2 .
It is a cyclic number.
It is not a de Polignac number, because 11006636205613 - 29 = 11006636205101 is a prime.
It is a super-2 number, since 2×110066362056132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11006636205683) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5503318102806 + 5503318102807.
It is an arithmetic number, because the mean of its divisors is an integer number (5503318102807).
Almost surely, 211006636205613 is an apocalyptic number.
It is an amenable number.
11006636205613 is a deficient number, since it is larger than the sum of its proper divisors (1).
11006636205613 is an equidigital number, since it uses as much as digits as its factorization.
11006636205613 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 116640, while the sum is 40.
Adding to 11006636205613 its reverse (31650263660011), we get a palindrome (42656899865624).
The spelling of 11006636205613 in words is "eleven trillion, six billion, six hundred thirty-six million, two hundred five thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •