Base | Representation |
---|---|
bin | 1010010011100011101101… |
… | …1101000100000010110011 |
3 | 1111010020121022121112111212 |
4 | 2210320323131010002303 |
5 | 2441122114011420311 |
6 | 40033240100030335 |
7 | 2246434514022251 |
oct | 244707335040263 |
9 | 44106538545455 |
10 | 11331121201331 |
11 | 3679557575408 |
12 | 13300696923ab |
13 | 64269b9ac899 |
14 | 2b26019bd5d1 |
15 | 149b36114c8b |
hex | a4e3b7440b3 |
11331121201331 has 16 divisors (see below), whose sum is σ = 11374389411840. Its totient is φ = 11287946329440.
The previous prime is 11331121201327. The next prime is 11331121201357. The reversal of 11331121201331 is 13310212113311.
It is a cyclic number.
It is not a de Polignac number, because 11331121201331 - 22 = 11331121201327 is a prime.
It is a super-2 number, since 2×113311212013312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11331121201297 and 11331121201306.
It is not an unprimeable number, because it can be changed into a prime (11331121261331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1873838750 + ... + 1873844796.
It is an arithmetic number, because the mean of its divisors is an integer number (710899338240).
Almost surely, 211331121201331 is an apocalyptic number.
11331121201331 is a deficient number, since it is larger than the sum of its proper divisors (43268210509).
11331121201331 is an equidigital number, since it uses as much as digits as its factorization.
11331121201331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12634.
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 11331121201331 its reverse (13310212113311), we get a palindrome (24641333314642).
The spelling of 11331121201331 in words is "eleven trillion, three hundred thirty-one billion, one hundred twenty-one million, two hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •