Base | Representation |
---|---|
bin | 1010000110101111101111… |
… | …0111010110110011101100 |
3 | 1110100012110110110210102010 |
4 | 2201223323313112303230 |
5 | 2424020322310120022 |
6 | 35344154503001220 |
7 | 2224513132243101 |
oct | 241537367266354 |
9 | 43305413423363 |
10 | 11111011020012 |
11 | 35a417606a352 |
12 | 12b547b139210 |
13 | 6279c1219047 |
14 | 2a5ac0b34aa8 |
15 | 14405240d50c |
hex | a1afbdd6cec |
11111011020012 has 24 divisors (see below), whose sum is σ = 25926227070912. Its totient is φ = 3703593955600.
The previous prime is 11111011019963. The next prime is 11111011020023. The reversal of 11111011020012 is 21002011011111.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a self number, because there is not a number n which added to its sum of digits gives 11111011020012.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8940414 + ... + 10107077.
It is an arithmetic number, because the mean of its divisors is an integer number (1080259461288).
Almost surely, 211111011020012 is an apocalyptic number.
11111011020012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11111011020012 is an abundant number, since it is smaller than the sum of its proper divisors (14815216050900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11111011020012 is a wasteful number, since it uses less digits than its factorization.
11111011020012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19096109 (or 19096107 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11111011020012 its reverse (21002011011111), we get a palindrome (32113022031123).
The spelling of 11111011020012 in words is "eleven trillion, one hundred eleven billion, eleven million, twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •