Base | Representation |
---|---|
bin | 10100100000101000… |
… | …00010001101000001 |
3 | 1001102101100010020222 |
4 | 22100110002031001 |
5 | 140022320334401 |
6 | 5020342112425 |
7 | 536602565456 |
oct | 122024021501 |
9 | 31371303228 |
10 | 11011105601 |
11 | 4740533681 |
12 | 217371b715 |
13 | 1066315502 |
14 | 76656182d |
15 | 446a34c1b |
hex | 290502341 |
11011105601 has 2 divisors, whose sum is σ = 11011105602. Its totient is φ = 11011105600.
The previous prime is 11011105597. The next prime is 11011105619. The reversal of 11011105601 is 10650111011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10862850625 + 148254976 = 104225^2 + 12176^2 .
It is an emirp because it is prime and its reverse (10650111011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11011105601 - 22 = 11011105597 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11011105601.
It is not a weakly prime, because it can be changed into another prime (11011105661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505552800 + 5505552801.
It is an arithmetic number, because the mean of its divisors is an integer number (5505552801).
Almost surely, 211011105601 is an apocalyptic number.
It is an amenable number.
11011105601 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011105601 is an equidigital number, since it uses as much as digits as its factorization.
11011105601 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 30, while the sum is 17.
Adding to 11011105601 its reverse (10650111011), we get a palindrome (21661216612).
It can be divided in two parts, 11011 and 105601, that multiplied together give a palindrome (1162772611).
The spelling of 11011105601 in words is "eleven billion, eleven million, one hundred five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •