Base | Representation |
---|---|
bin | 1010000000111000010001… |
… | …0000001101010011001001 |
3 | 1102222120022011102112102101 |
4 | 2200032010100031103021 |
5 | 2420342412311132222 |
6 | 35230005242033401 |
7 | 2214314342006614 |
oct | 240160420152311 |
9 | 42876264375371 |
10 | 11010220020937 |
11 | 3565454190a05 |
12 | 1299a304a8861 |
13 | 61b34a888617 |
14 | 2a0c7ca0d17b |
15 | 141603a28927 |
hex | a038440d4c9 |
11010220020937 has 2 divisors, whose sum is σ = 11010220020938. Its totient is φ = 11010220020936.
The previous prime is 11010220020913. The next prime is 11010220021013. The reversal of 11010220020937 is 73902002201011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9340914676681 + 1669305344256 = 3056291^2 + 1292016^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010220020937 - 231 = 11008072537289 is a prime.
It is not a weakly prime, because it can be changed into another prime (11010220020337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505110010468 + 5505110010469.
It is an arithmetic number, because the mean of its divisors is an integer number (5505110010469).
Almost surely, 211010220020937 is an apocalyptic number.
It is an amenable number.
11010220020937 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010220020937 is an equidigital number, since it uses as much as digits as its factorization.
11010220020937 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 28.
Adding to 11010220020937 its reverse (73902002201011), we get a palindrome (84912222221948).
The spelling of 11010220020937 in words is "eleven trillion, ten billion, two hundred twenty million, twenty thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •