Base | Representation |
---|---|
bin | 1010000000111011001111… |
… | …1011111000101111010011 |
3 | 1102222122100220201200200101 |
4 | 2200032303323320233103 |
5 | 2420401032110001321 |
6 | 35230220500233231 |
7 | 2214343224505660 |
oct | 240166373705723 |
9 | 42878326650611 |
10 | 11011020000211 |
11 | 3565824808200 |
12 | 129a01439b817 |
13 | 61b447531c3a |
14 | 2a0d16d70a67 |
15 | 14164dd99791 |
hex | a03b3ef8bd3 |
11011020000211 has 24 divisors (see below), whose sum is σ = 13833373462272. Its totient is φ = 8579179210800.
The previous prime is 11011020000193. The next prime is 11011020000223. The reversal of 11011020000211 is 11200002011011.
It is not a de Polignac number, because 11011020000211 - 221 = 11011017903059 is a prime.
It is a super-2 number, since 2×110110200002112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11011020000271) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8132076 + ... + 9388966.
It is an arithmetic number, because the mean of its divisors is an integer number (576390560928).
Almost surely, 211011020000211 is an apocalyptic number.
11011020000211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11011020000211 is a deficient number, since it is larger than the sum of its proper divisors (2822353462061).
11011020000211 is a wasteful number, since it uses less digits than its factorization.
11011020000211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1267263 (or 1267252 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11011020000211 its reverse (11200002011011), we get a palindrome (22211022011222).
The spelling of 11011020000211 in words is "eleven trillion, eleven billion, twenty million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •