Base | Representation |
---|---|
bin | 1010000100001010011111… |
… | …0101001001011000110101 |
3 | 1110011221221222011202112222 |
4 | 2201002213311021120311 |
5 | 2422304000234403103 |
6 | 35311541032052125 |
7 | 2221352640343655 |
oct | 241024765113065 |
9 | 43157858152488 |
10 | 11066651481653 |
11 | 3587382288649 |
12 | 12a895b234045 |
13 | 623771bcc4b1 |
14 | 2a38b3582365 |
15 | 142d07d31638 |
hex | a10a7d49635 |
11066651481653 has 2 divisors, whose sum is σ = 11066651481654. Its totient is φ = 11066651481652.
The previous prime is 11066651481643. The next prime is 11066651481659. The reversal of 11066651481653 is 35618415666011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10544353300849 + 522298180804 = 3247207^2 + 722702^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11066651481653 is a prime.
It is a super-2 number, since 2×110666514816532 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11066651481595 and 11066651481604.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11066651481659) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5533325740826 + 5533325740827.
It is an arithmetic number, because the mean of its divisors is an integer number (5533325740827).
Almost surely, 211066651481653 is an apocalyptic number.
It is an amenable number.
11066651481653 is a deficient number, since it is larger than the sum of its proper divisors (1).
11066651481653 is an equidigital number, since it uses as much as digits as its factorization.
11066651481653 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3110400, while the sum is 53.
The spelling of 11066651481653 in words is "eleven trillion, sixty-six billion, six hundred fifty-one million, four hundred eighty-one thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •