Base | Representation |
---|---|
bin | 1010000000111011001111… |
… | …1011111000101111001001 |
3 | 1102222122100220201200200000 |
4 | 2200032303323320233021 |
5 | 2420401032110001301 |
6 | 35230220500233213 |
7 | 2214343224505644 |
oct | 240166373705711 |
9 | 42878326650600 |
10 | 11011020000201 |
11 | 35658248081a1 |
12 | 129a01439b809 |
13 | 61b447531c30 |
14 | 2a0d16d70a5b |
15 | 14164dd99786 |
hex | a03b3ef8bc9 |
11011020000201 has 48 divisors (see below), whose sum is σ = 17771146673280. Its totient is φ = 6772764585600.
The previous prime is 11011020000193. The next prime is 11011020000223. The reversal of 11011020000201 is 10200002011011.
It is a happy number.
It is not a de Polignac number, because 11011020000201 - 23 = 11011020000193 is a prime.
It is a super-2 number, since 2×110110200002012 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
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 47 ways as a sum of consecutive naturals, for example, 5764876 + ... + 7433426.
It is an arithmetic number, because the mean of its divisors is an integer number (370232222360).
Almost surely, 211011020000201 is an apocalyptic number.
It is an amenable number.
11011020000201 is a deficient number, since it is larger than the sum of its proper divisors (6760126673079).
11011020000201 is a wasteful number, since it uses less digits than its factorization.
11011020000201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1670668 (or 1670656 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11011020000201 its reverse (10200002011011), we get a palindrome (21211022011212).
The spelling of 11011020000201 in words is "eleven trillion, eleven billion, twenty million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •