Base | Representation |
---|---|
bin | 1010000001011101100100… |
… | …0001010011011110000000 |
3 | 1110000112010220221110100220 |
4 | 2200113121001103132000 |
5 | 2421023413410041000 |
6 | 35234342535543040 |
7 | 2215120424250516 |
oct | 240273101233600 |
9 | 43015126843326 |
10 | 11020232112000 |
11 | 3569721804131 |
12 | 129b96552aa80 |
13 | 61c284c1a367 |
14 | 2a154c5dc4b6 |
15 | 1419dc9c41a0 |
hex | a05d9053780 |
11020232112000 has 128 divisors (see below), whose sum is σ = 36532069610400. Its totient is φ = 2938728550400.
The previous prime is 11020232111963. The next prime is 11020232112013. The reversal of 11020232112000 is 21123202011.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 114746085 + ... + 114842084.
Almost surely, 211020232112000 is an apocalyptic number.
11020232112000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11020232112000 is an abundant number, since it is smaller than the sum of its proper divisors (25511837498400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020232112000 is an equidigital number, since it uses as much as digits as its factorization.
11020232112000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229588201 (or 229588179 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 11020232112000 its reverse (21123202011), we get a palindrome (11041355314011).
The spelling of 11020232112000 in words is "eleven trillion, twenty billion, two hundred thirty-two million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •