Base | Representation |
---|---|
bin | 1010000000101010111110… |
… | …0011100111001011001001 |
3 | 1102222020002110201222011112 |
4 | 2200022233203213023021 |
5 | 2420313110244420044 |
6 | 35224215205340105 |
7 | 2214130041415403 |
oct | 240125743471311 |
9 | 42866073658145 |
10 | 11006651560649 |
11 | 3563992954978 |
12 | 12991b5407635 |
13 | 61abcc49c264 |
14 | 2a0a20b0db73 |
15 | 1414955e709e |
hex | a02af8e72c9 |
11006651560649 has 2 divisors, whose sum is σ = 11006651560650. Its totient is φ = 11006651560648.
The previous prime is 11006651560577. The next prime is 11006651560669. The reversal of 11006651560649 is 94606515660011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10745729812624 + 260921748025 = 3278068^2 + 510805^2 .
It is a cyclic number.
It is not a de Polignac number, because 11006651560649 - 216 = 11006651495113 is a prime.
It is a super-2 number, since 2×110066515606492 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11006651560597 and 11006651560606.
It is not a weakly prime, because it can be changed into another prime (11006651560669) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5503325780324 + 5503325780325.
It is an arithmetic number, because the mean of its divisors is an integer number (5503325780325).
Almost surely, 211006651560649 is an apocalyptic number.
It is an amenable number.
11006651560649 is a deficient number, since it is larger than the sum of its proper divisors (1).
11006651560649 is an equidigital number, since it uses as much as digits as its factorization.
11006651560649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1166400, while the sum is 50.
The spelling of 11006651560649 in words is "eleven trillion, six billion, six hundred fifty-one million, five hundred sixty thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •