Base | Representation |
---|---|
bin | 1010000011111111110001… |
… | …1001001111111110100001 |
3 | 1110011200112112001210121011 |
4 | 2200333330121033332201 |
5 | 2422232102431432143 |
6 | 35310343404500521 |
7 | 2221221444036505 |
oct | 240777431177641 |
9 | 43150475053534 |
10 | 11063775264673 |
11 | 358613678321a |
12 | 12a8297b4a741 |
13 | 623404067a61 |
14 | 2a36bd59c305 |
15 | 142bda58de9d |
hex | a0ffc64ffa1 |
11063775264673 has 2 divisors, whose sum is σ = 11063775264674. Its totient is φ = 11063775264672.
The previous prime is 11063775264617. The next prime is 11063775264683. The reversal of 11063775264673 is 37646257736011.
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., 10291315328064 + 772459936609 = 3208008^2 + 878897^2 .
It is an emirp because it is prime and its reverse (37646257736011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11063775264673 - 217 = 11063775133601 is a prime.
It is a super-2 number, since 2×110637752646732 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11063775264613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5531887632336 + 5531887632337.
It is an arithmetic number, because the mean of its divisors is an integer number (5531887632337).
Almost surely, 211063775264673 is an apocalyptic number.
It is an amenable number.
11063775264673 is a deficient number, since it is larger than the sum of its proper divisors (1).
11063775264673 is an equidigital number, since it uses as much as digits as its factorization.
11063775264673 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 26671680, while the sum is 58.
The spelling of 11063775264673 in words is "eleven trillion, sixty-three billion, seven hundred seventy-five million, two hundred sixty-four thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •