Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0110010000100001001010 |
3 | 1111010020122001221011221210 |
4 | 2210320330012100201022 |
5 | 2441122124243002310 |
6 | 40033241123313550 |
7 | 2246435004560232 |
oct | 244707406204112 |
9 | 44106561834853 |
10 | 11331132000330 |
11 | 36795626808aa |
12 | 133007121b8b6 |
13 | 6426a0cc101c |
14 | 2b26031d0cc2 |
15 | 149b37049820 |
hex | a4e3c19084a |
11331132000330 has 32 divisors (see below), whose sum is σ = 28794406025664. Its totient is φ = 2843891952896.
The previous prime is 11331132000281. The next prime is 11331132000371. The reversal of 11331132000330 is 3300023113311.
It is a junction number, because it is equal to n+sod(n) for n = 11331132000297 and 11331132000306.
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, 11108952432 + ... + 11108953451.
It is an arithmetic number, because the mean of its divisors is an integer number (899825188302).
Almost surely, 211331132000330 is an apocalyptic number.
11331132000330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11331132000330 is an abundant number, since it is smaller than the sum of its proper divisors (17463274025334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11331132000330 is a wasteful number, since it uses less digits than its factorization.
11331132000330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22217905910.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 11331132000330 its reverse (3300023113311), we get a palindrome (14631155113641).
The spelling of 11331132000330 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-two million, three hundred thirty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •