Base | Representation |
---|---|
bin | 1010000000101001110100… |
… | …1100100101010101011101 |
3 | 1102222012022000010120221001 |
4 | 2200022131030211111131 |
5 | 2420311442421041132 |
6 | 35224124443310301 |
7 | 2214116311265314 |
oct | 240123514452535 |
9 | 42865260116831 |
10 | 11006343533917 |
11 | 3563844a98926 |
12 | 129912a21b391 |
13 | 61ab80720b14 |
14 | 2a09d1c4b27b |
15 | 14147854ece7 |
hex | a029d32555d |
11006343533917 has 2 divisors, whose sum is σ = 11006343533918. Its totient is φ = 11006343533916.
The previous prime is 11006343533909. The next prime is 11006343533981. The reversal of 11006343533917 is 71933534360011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7684932053241 + 3321411480676 = 2772171^2 + 1822474^2 .
It is a cyclic number.
It is not a de Polignac number, because 11006343533917 - 23 = 11006343533909 is a prime.
It is a super-2 number, since 2×110063435339172 (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 (11006343533117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5503171766958 + 5503171766959.
It is an arithmetic number, because the mean of its divisors is an integer number (5503171766959).
Almost surely, 211006343533917 is an apocalyptic number.
It is an amenable number.
11006343533917 is a deficient number, since it is larger than the sum of its proper divisors (1).
11006343533917 is an equidigital number, since it uses as much as digits as its factorization.
11006343533917 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 612360, while the sum is 46.
Adding to 11006343533917 its reverse (71933534360011), we get a palindrome (82939877893928).
The spelling of 11006343533917 in words is "eleven trillion, six billion, three hundred forty-three million, five hundred thirty-three thousand, nine hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •