Base | Representation |
---|---|
bin | 1010000000110111110111… |
… | …0000010101011001101100 |
3 | 1102222120000120021210212010 |
4 | 2200031331300111121230 |
5 | 2420342201404032340 |
6 | 35225550345241220 |
7 | 2214311546243031 |
oct | 240157560253154 |
9 | 42876016253763 |
10 | 11010111002220 |
11 | 35653a869a5a0 |
12 | 12999bba93210 |
13 | 61b331107ac5 |
14 | 2a0c6c351388 |
15 | 1415e9191b80 |
hex | a037dc1566c |
11010111002220 has 48 divisors (see below), whose sum is σ = 33630884517888. Its totient is φ = 2669117818560.
The previous prime is 11010111002197. The next prime is 11010111002263. The reversal of 11010111002220 is 2220011101011.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 11010111002196 and 11010111002205.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8340992524 + ... + 8340993843.
It is an arithmetic number, because the mean of its divisors is an integer number (700643427456).
Almost surely, 211010111002220 is an apocalyptic number.
11010111002220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11010111002220 is an abundant number, since it is smaller than the sum of its proper divisors (22620773515668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010111002220 is a wasteful number, since it uses less digits than its factorization.
11010111002220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16681986390 (or 16681986388 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11010111002220 its reverse (2220011101011), we get a palindrome (13230122103231).
The spelling of 11010111002220 in words is "eleven trillion, ten billion, one hundred eleven million, two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •