Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0110010001001111100101 |
3 | 1111010020122001221100000211 |
4 | 2210320330012101033211 |
5 | 2441122124243101201 |
6 | 40033241123335421 |
7 | 2246435004602005 |
oct | 244707406211745 |
9 | 44106561840024 |
10 | 11331132003301 |
11 | 3679562683060 |
12 | 1330071221571 |
13 | 6426a0cc2496 |
14 | 2b26031d2005 |
15 | 149b3704a651 |
hex | a4e3c1913e5 |
11331132003301 has 64 divisors (see below), whose sum is σ = 13405699584000. Its totient is φ = 9487061115840.
The previous prime is 11331132003277. The next prime is 11331132003341. The reversal of 11331132003301 is 10330023113311.
It is not a de Polignac number, because 11331132003301 - 219 = 11331131479013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11331132003341) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1470998616 + ... + 1471006318.
It is an arithmetic number, because the mean of its divisors is an integer number (209464056000).
Almost surely, 211331132003301 is an apocalyptic number.
11331132003301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11331132003301 is a deficient number, since it is larger than the sum of its proper divisors (2074567580699).
11331132003301 is an equidigital number, since it uses as much as digits as its factorization.
11331132003301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8191 (or 8145 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 11331132003301 its reverse (10330023113311), we get a palindrome (21661155116612).
The spelling of 11331132003301 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-two million, three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •