Base | Representation |
---|---|
bin | 1010000000010110001000… |
… | …0000110000011010100101 |
3 | 1102221200122110222020201211 |
4 | 2200011202000300122211 |
5 | 2420220130214014113 |
6 | 35221452024551421 |
7 | 2213541261550132 |
oct | 240054200603245 |
9 | 42850573866654 |
10 | 11001055610533 |
11 | 356158110580a |
12 | 12980b3322571 |
13 | 61a51a032281 |
14 | 2a064d83b589 |
15 | 1412691c2b3d |
hex | a01620306a5 |
11001055610533 has 2 divisors, whose sum is σ = 11001055610534. Its totient is φ = 11001055610532.
The previous prime is 11001055610497. The next prime is 11001055610551. The reversal of 11001055610533 is 33501655010011.
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., 10965754085764 + 35301524769 = 3311458^2 + 187887^2 .
It is an emirp because it is prime and its reverse (33501655010011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11001055610533 - 29 = 11001055610021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11001055610495 and 11001055610504.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11001055610593) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500527805266 + 5500527805267.
It is an arithmetic number, because the mean of its divisors is an integer number (5500527805267).
Almost surely, 211001055610533 is an apocalyptic number.
It is an amenable number.
11001055610533 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001055610533 is an equidigital number, since it uses as much as digits as its factorization.
11001055610533 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6750, while the sum is 31.
The spelling of 11001055610533 in words is "eleven trillion, one billion, fifty-five million, six hundred ten thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •