Base | Representation |
---|---|
bin | 1010000110000111001010… |
… | …1101011111100000010100 |
3 | 1110022011100110010201102210 |
4 | 2201201302231133200110 |
5 | 2423331021211133022 |
6 | 35335154051033420 |
7 | 2223646215261321 |
oct | 241416255374024 |
9 | 43264313121383 |
10 | 11100120021012 |
11 | 359a597410630 |
12 | 12b333b89b870 |
13 | 626976a67139 |
14 | 2a536a519b48 |
15 | 143b16200a0c |
hex | a1872b5f814 |
11100120021012 has 96 divisors (see below), whose sum is σ = 28850972137344. Its totient is φ = 3293378611200.
The previous prime is 11100120020981. The next prime is 11100120021013. The reversal of 11100120021012 is 21012002100111.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100120021013) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2884039 + ... + 5524302.
It is an arithmetic number, because the mean of its divisors is an integer number (300530959764).
Almost surely, 211100120021012 is an apocalyptic number.
11100120021012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11100120021012 is an abundant number, since it is smaller than the sum of its proper divisors (17750852116332).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11100120021012 is a wasteful number, since it uses less digits than its factorization.
11100120021012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8408569 (or 8408567 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11100120021012 its reverse (21012002100111), we get a palindrome (32112122121123).
The spelling of 11100120021012 in words is "eleven trillion, one hundred billion, one hundred twenty million, twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •