Base | Representation |
---|---|
bin | 1010000000111111101110… |
… | …0001010110000011000000 |
3 | 1102222202110121121220022011 |
4 | 2200033323201112003000 |
5 | 2420411012034030140 |
6 | 35230540002022304 |
7 | 2214415050035455 |
oct | 240177341260300 |
9 | 42882417556264 |
10 | 11012221001920 |
11 | 35662907385a6 |
12 | 129a2aa647994 |
13 | 61b5a92b7338 |
14 | 2a0dcc68182c |
15 | 1416be531cea |
hex | a03fb8560c0 |
11012221001920 has 56 divisors (see below), whose sum is σ = 26233866453168. Its totient is φ = 4403038080000.
The previous prime is 11012221001891. The next prime is 11012221001921. The reversal of 11012221001920 is 2910012221011.
It is a super-2 number, since 2×110122210019202 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11012221001891 and 11012221001900.
It is not an unprimeable number, because it can be changed into a prime (11012221001921) 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, 6464706 + ... + 7988545.
Almost surely, 211012221001920 is an apocalyptic number.
11012221001920 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11012221001920 is an abundant number, since it is smaller than the sum of its proper divisors (15221645451248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11012221001920 is a wasteful number, since it uses less digits than its factorization.
11012221001920 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14455649 (or 14455639 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 22.
Adding to 11012221001920 its reverse (2910012221011), we get a palindrome (13922233222931).
The spelling of 11012221001920 in words is "eleven trillion, twelve billion, two hundred twenty-one million, one thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •