Base | Representation |
---|---|
bin | 1010000000111000010001… |
… | …0000001101010100010011 |
3 | 1102222120022011102112112010 |
4 | 2200032010100031110103 |
5 | 2420342412311133021 |
6 | 35230005242034003 |
7 | 2214314342010051 |
oct | 240160420152423 |
9 | 42876264375463 |
10 | 11010220021011 |
11 | 3565454190a72 |
12 | 1299a304a8903 |
13 | 61b34a888673 |
14 | 2a0c7ca0d1d1 |
15 | 141603a28976 |
hex | a038440d513 |
11010220021011 has 8 divisors (see below), whose sum is σ = 14680524441600. Its totient is φ = 7340031140552.
The previous prime is 11010220020937. The next prime is 11010220021013. The reversal of 11010220021011 is 11012002201011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11010220021011 - 213 = 11010220012819 is a prime.
It is a super-2 number, since 2×110102200210112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11010220021013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28662435 + ... + 29044028.
It is an arithmetic number, because the mean of its divisors is an integer number (1835065555200).
Almost surely, 211010220021011 is an apocalyptic number.
11010220021011 is a deficient number, since it is larger than the sum of its proper divisors (3670304420589).
11010220021011 is an equidigital number, since it uses as much as digits as its factorization.
11010220021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57770065.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11010220021011 its reverse (11012002201011), we get a palindrome (22022222222022).
The spelling of 11010220021011 in words is "eleven trillion, ten billion, two hundred twenty million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •