Base | Representation |
---|---|
bin | 1010000001011101111011… |
… | …1011011000000101010100 |
3 | 1110000112101211102201210220 |
4 | 2200113132323120011110 |
5 | 2421024114243040312 |
6 | 35234400440114340 |
7 | 2215123036543146 |
oct | 240273673300524 |
9 | 43015354381726 |
10 | 11020331221332 |
11 | 3569772747474 |
12 | 129b9927659b0 |
13 | 61c29c60b634 |
14 | 2a155b83ac96 |
15 | 1419e654ec8c |
hex | a05deed8154 |
11020331221332 has 12 divisors (see below), whose sum is σ = 25714106183136. Its totient is φ = 3673443740440.
The previous prime is 11020331221313. The next prime is 11020331221369. The reversal of 11020331221332 is 23312213302011.
It is a tau number, because it is divible by the number of its divisors (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 459180467544 + ... + 459180467567.
It is an arithmetic number, because the mean of its divisors is an integer number (2142842181928).
Almost surely, 211020331221332 is an apocalyptic number.
11020331221332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11020331221332 is an abundant number, since it is smaller than the sum of its proper divisors (14693774961804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020331221332 is a wasteful number, since it uses less digits than its factorization.
11020331221332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 918360935118 (or 918360935116 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 11020331221332 its reverse (23312213302011), we get a palindrome (34332544523343).
The spelling of 11020331221332 in words is "eleven trillion, twenty billion, three hundred thirty-one million, two hundred twenty-one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •