Base | Representation |
---|---|
bin | 1010000111110111101000… |
… | …1111110001101100101100 |
3 | 1110102001021112012112112100 |
4 | 2201331322033301230230 |
5 | 2424324334133020022 |
6 | 35401105553135100 |
7 | 2226065326240545 |
oct | 241757217615454 |
9 | 43361245175470 |
10 | 11130311220012 |
11 | 360137a576266 |
12 | 12b916685a490 |
13 | 62977892462a |
14 | 2a69d20d54cc |
15 | 1447d19e61ac |
hex | a1f7a3f1b2c |
11130311220012 has 18 divisors (see below), whose sum is σ = 28134953361788. Its totient is φ = 3710103739992.
The previous prime is 11130311219969. The next prime is 11130311220059. The reversal of 11130311220012 is 21002211303111.
11130311220012 is a `hidden beast` number, since 1 + 1 + 130 + 311 + 220 + 0 + 1 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 154587655798 + ... + 154587655869.
Almost surely, 211130311220012 is an apocalyptic number.
11130311220012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11130311220012 is an abundant number, since it is smaller than the sum of its proper divisors (17004642141776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11130311220012 is a wasteful number, since it uses less digits than its factorization.
11130311220012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309175311677 (or 309175311672 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 11130311220012 its reverse (21002211303111), we get a palindrome (32132522523123).
The spelling of 11130311220012 in words is "eleven trillion, one hundred thirty billion, three hundred eleven million, two hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •