Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0011001101001101001101 |
3 | 1111010020122000102112120021 |
4 | 2210320330003031031031 |
5 | 2441122124041402313 |
6 | 40033241054222141 |
7 | 2246434665016000 |
oct | 244707403151515 |
9 | 44106560375507 |
10 | 11331131200333 |
11 | 367956218484a |
12 | 1330070ab4951 |
13 | 6426a0aa0b59 |
14 | 2b2603063537 |
15 | 149b36e3c78d |
hex | a4e3c0cd34d |
11331131200333 has 64 divisors (see below), whose sum is σ = 13503013286400. Its totient is φ = 9502240011264.
The previous prime is 11331131200309. The next prime is 11331131200351. The reversal of 11331131200333 is 33300213113311.
It is a de Polignac number, because none of the positive numbers 2k-11331131200333 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11331131200298 and 11331131200307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11331131200373) 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, 3064951141 + ... + 3064954837.
It is an arithmetic number, because the mean of its divisors is an integer number (210984582600).
Almost surely, 211331131200333 is an apocalyptic number.
It is an amenable number.
11331131200333 is a deficient number, since it is larger than the sum of its proper divisors (2171882086067).
11331131200333 is an equidigital number, since it uses as much as digits as its factorization.
11331131200333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4659 (or 4645 counting only the distinct ones).
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 11331131200333 its reverse (33300213113311), we get a palindrome (44631344313644).
The spelling of 11331131200333 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-one million, two hundred thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •