Base | Representation |
---|---|
bin | 1010000000101011000100… |
… | …1111010011001000010001 |
3 | 1102222020011102212011200122 |
4 | 2200022301033103020101 |
5 | 2420313140011240342 |
6 | 35224222054400025 |
7 | 2214130533361115 |
oct | 240126117231021 |
9 | 42866142764618 |
10 | 11006679790097 |
11 | 35639a78860a2 |
12 | 1299202960015 |
13 | 61ac052a4384 |
14 | 2a0a2477b745 |
15 | 141497d214d2 |
hex | a02b13d3211 |
11006679790097 has 2 divisors, whose sum is σ = 11006679790098. Its totient is φ = 11006679790096.
The previous prime is 11006679790063. The next prime is 11006679790121. The reversal of 11006679790097 is 79009797660011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10246407402001 + 760272388096 = 3201001^2 + 871936^2 .
It is a cyclic number.
It is not a de Polignac number, because 11006679790097 - 216 = 11006679724561 is a prime.
It is a super-2 number, since 2×110066797900972 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11006679390097) 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 as a sum of consecutive naturals, namely, 5503339895048 + 5503339895049.
It is an arithmetic number, because the mean of its divisors is an integer number (5503339895049).
Almost surely, 211006679790097 is an apocalyptic number.
It is an amenable number.
11006679790097 is a deficient number, since it is larger than the sum of its proper divisors (1).
11006679790097 is an equidigital number, since it uses as much as digits as its factorization.
11006679790097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9001692, while the sum is 62.
The spelling of 11006679790097 in words is "eleven trillion, six billion, six hundred seventy-nine million, seven hundred ninety thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.418 sec. • engine limits •