Base | Representation |
---|---|
bin | 1010001101001101100101… |
… | …0010001110101111100000 |
3 | 1110201211012110000021221210 |
4 | 2203103121102032233200 |
5 | 2432330330100341000 |
6 | 35511210033350120 |
7 | 2235525046141233 |
oct | 243233122165740 |
9 | 43654173007853 |
10 | 11222100012000 |
11 | 36372a1996239 |
12 | 1312b02708340 |
13 | 6353162112b7 |
14 | 2ab21c7cd41a |
15 | 146da4e15350 |
hex | a34d948ebe0 |
11222100012000 has 96 divisors (see below), whose sum is σ = 36763599678624. Its totient is φ = 2992560000000.
The previous prime is 11222100011977. The next prime is 11222100012043. The reversal of 11222100012000 is 21000122211.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (12).
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, 467575501 + ... + 467599500.
It is an arithmetic number, because the mean of its divisors is an integer number (382954163319).
Almost surely, 211222100012000 is an apocalyptic number.
11222100012000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11222100012000 is an abundant number, since it is smaller than the sum of its proper divisors (25541499666624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11222100012000 is an equidigital number, since it uses as much as digits as its factorization.
11222100012000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 935175029 (or 935175011 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11222100012000 its reverse (21000122211), we get a palindrome (11243100134211).
The spelling of 11222100012000 in words is "eleven trillion, two hundred twenty-two billion, one hundred million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •