Base | Representation |
---|---|
bin | 1010000000110111011111… |
… | …0010111001110001111100 |
3 | 1102222112202121010210100210 |
4 | 2200031313302321301330 |
5 | 2420342000304342340 |
6 | 35225532414152420 |
7 | 2214306223322013 |
oct | 240156762716174 |
9 | 42875677123323 |
10 | 11010011012220 |
11 | 3565357205630 |
12 | 12999924b2710 |
13 | 61b316498a1c |
14 | 2a0c5cd63a7a |
15 | 1415e04e0180 |
hex | a0377cb9c7c |
11010011012220 has 48 divisors (see below), whose sum is σ = 33630579093888. Its totient is φ = 2669093578560.
The previous prime is 11010011012179. The next prime is 11010011012239. The reversal of 11010011012220 is 2221011001011.
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 = 11010011012196 and 11010011012205.
It is a congruent number.
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, 8340916774 + ... + 8340918093.
It is an arithmetic number, because the mean of its divisors is an integer number (700637064456).
Almost surely, 211010011012220 is an apocalyptic number.
11010011012220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11010011012220 is an abundant number, since it is smaller than the sum of its proper divisors (22620568081668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010011012220 is a wasteful number, since it uses less digits than its factorization.
11010011012220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16681834890 (or 16681834888 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11010011012220 its reverse (2221011001011), we get a palindrome (13231022013231).
The spelling of 11010011012220 in words is "eleven trillion, ten billion, eleven million, twelve thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •