Base | Representation |
---|---|
bin | 1010010100000101111100… |
… | …1010110001111101001101 |
3 | 1111011010022201120021201020 |
4 | 2211001133022301331031 |
5 | 2441244423420314041 |
6 | 40041355554504353 |
7 | 2250211314202431 |
oct | 245013712617515 |
9 | 44133281507636 |
10 | 11340310323021 |
11 | 3682442599559 |
12 | 13319b2b950b9 |
13 | 6435046a88b4 |
14 | 2b2c341849c1 |
15 | 149ec2bec866 |
hex | a505f2b1f4d |
11340310323021 has 16 divisors (see below), whose sum is σ = 15472712065536. Its totient is φ = 7384072748976.
The previous prime is 11340310322993. The next prime is 11340310323031. The reversal of 11340310323021 is 12032301304311.
It is not a de Polignac number, because 11340310323021 - 25 = 11340310322989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11340310322982 and 11340310323000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11340310323031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1174216 + ... + 4905038.
It is an arithmetic number, because the mean of its divisors is an integer number (967044504096).
Almost surely, 211340310323021 is an apocalyptic number.
It is an amenable number.
11340310323021 is a deficient number, since it is larger than the sum of its proper divisors (4132401742515).
11340310323021 is a wasteful number, since it uses less digits than its factorization.
11340310323021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3754432.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 11340310323021 its reverse (12032301304311), we get a palindrome (23372611627332).
The spelling of 11340310323021 in words is "eleven trillion, three hundred forty billion, three hundred ten million, three hundred twenty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •