Base | Representation |
---|---|
bin | 1010010011100000101111… |
… | …1000100110010010010100 |
3 | 1111010011112200212110021210 |
4 | 2210320023320212102110 |
5 | 2441114000204104413 |
6 | 40033024550141420 |
7 | 2246405653260366 |
oct | 244701370462224 |
9 | 44104480773253 |
10 | 11330323113108 |
11 | 367918801a96a |
12 | 132ba86351870 |
13 | 6425a2548c2c |
14 | 2b25679d0d36 |
15 | 149adb0193c3 |
hex | a4e0be26494 |
11330323113108 has 12 divisors (see below), whose sum is σ = 26437420597280. Its totient is φ = 3776774371032.
The previous prime is 11330323113089. The next prime is 11330323113139. The reversal of 11330323113108 is 80131132303311.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×113303231131082 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 472096796368 + ... + 472096796391.
Almost surely, 211330323113108 is an apocalyptic number.
It is an amenable number.
11330323113108 is an abundant number, since it is smaller than the sum of its proper divisors (15107097484172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11330323113108 is a wasteful number, since it uses less digits than its factorization.
11330323113108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 944193592766 (or 944193592764 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 30.
Adding to 11330323113108 its reverse (80131132303311), we get a palindrome (91461455416419).
The spelling of 11330323113108 in words is "eleven trillion, three hundred thirty billion, three hundred twenty-three million, one hundred thirteen thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •