Base | Representation |
---|---|
bin | 1010010011100000010111… |
… | …0100001110001000100111 |
3 | 1111010011021121021221010112 |
4 | 2210320011310032020213 |
5 | 2441113243123133221 |
6 | 40033010512043235 |
7 | 2246403306014042 |
oct | 244700564161047 |
9 | 44104247257115 |
10 | 11330221302311 |
11 | 3679135601a0a |
12 | 132ba5823351b |
13 | 642587420162 |
14 | 2b255828bc59 |
15 | 149ad210815b |
hex | a4e05d0e227 |
11330221302311 has 4 divisors (see below), whose sum is σ = 11405255880624. Its totient is φ = 11255186724000.
The previous prime is 11330221302307. The next prime is 11330221302359. The reversal of 11330221302311 is 11320312203311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11330221302311 - 22 = 11330221302307 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 (11330221302371) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 37517288930 + ... + 37517289231.
It is an arithmetic number, because the mean of its divisors is an integer number (2851313970156).
Almost surely, 211330221302311 is an apocalyptic number.
11330221302311 is a deficient number, since it is larger than the sum of its proper divisors (75034578313).
11330221302311 is an equidigital number, since it uses as much as digits as its factorization.
11330221302311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75034578312.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 11330221302311 its reverse (11320312203311), we get a palindrome (22650533505622).
The spelling of 11330221302311 in words is "eleven trillion, three hundred thirty billion, two hundred twenty-one million, three hundred two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •