Base | Representation |
---|---|
bin | 1010010011100011101011… |
… | …0111010111101100000010 |
3 | 1111010020120122000112022120 |
4 | 2210320322313113230002 |
5 | 2441122103444222242 |
6 | 40033235104145110 |
7 | 2246434334026533 |
oct | 244707267275402 |
9 | 44106518015276 |
10 | 11331111320322 |
11 | 3679551a36692 |
12 | 1330066308196 |
13 | 642699930231 |
14 | 2b260056a68a |
15 | 149b353121ec |
hex | a4e3add7b02 |
11331111320322 has 8 divisors (see below), whose sum is σ = 22662222640656. Its totient is φ = 3777037106772.
The previous prime is 11331111320297. The next prime is 11331111320351. The reversal of 11331111320322 is 22302311113311.
It is a sphenic number, since it is the product of 3 distinct primes.
11331111320322 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 11331111320292 and 11331111320301.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 944259276688 + ... + 944259276699.
It is an arithmetic number, because the mean of its divisors is an integer number (2832777830082).
Almost surely, 211331111320322 is an apocalyptic number.
11331111320322 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11331111320322 is a wasteful number, since it uses less digits than its factorization.
11331111320322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1888518553392.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 11331111320322 its reverse (22302311113311), we get a palindrome (33633422433633).
The spelling of 11331111320322 in words is "eleven trillion, three hundred thirty-one billion, one hundred eleven million, three hundred twenty thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •