Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0011101101001010100000 |
3 | 1111010020122000200012010101 |
4 | 2210320330003231022200 |
5 | 2441122124110044412 |
6 | 40033241101112144 |
7 | 2246434666102426 |
oct | 244707403551240 |
9 | 44106560605111 |
10 | 11331131331232 |
11 | 3679562264129 |
12 | 1330070b58654 |
13 | 6426a0b185cb |
14 | 2b2603099116 |
15 | 149b36e66457 |
hex | a4e3c0ed2a0 |
11331131331232 has 48 divisors (see below), whose sum is σ = 22911570081792. Its totient is φ = 5512326324480.
The previous prime is 11331131331229. The next prime is 11331131331259. The reversal of 11331131331232 is 23213313113311.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 11331131331232.
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 7 ways as a sum of consecutive naturals, for example, 91095193 + ... + 91219495.
It is an arithmetic number, because the mean of its divisors is an integer number (477324376704).
Almost surely, 211331131331232 is an apocalyptic number.
It is an amenable number.
11331131331232 is an abundant number, since it is smaller than the sum of its proper divisors (11580438750560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11331131331232 is a wasteful number, since it uses less digits than its factorization.
11331131331232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201341 (or 201333 counting only the distinct ones).
The product of its digits is 2916, while the sum is 28.
Adding to 11331131331232 its reverse (23213313113311), we get a palindrome (34544444444543).
The spelling of 11331131331232 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-one million, three hundred thirty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •