Base | Representation |
---|---|
bin | 1001100100001001001110… |
… | …01111100001111111001111 |
3 | 2202110202010211021101000021 |
4 | 10302010213033201333033 |
5 | 10224101303441400221 |
6 | 112422251232043011 |
7 | 4300410103422616 |
oct | 462044717417717 |
9 | 82422124241007 |
10 | 21033113231311 |
11 | 677a1030a57a5 |
12 | 2438437093467 |
13 | b9754c922c6c |
14 | 52a01838c87d |
15 | 2671bd6d5041 |
hex | 1321273e1fcf |
21033113231311 has 8 divisors (see below), whose sum is σ = 22276441711440. Its totient is φ = 19790461031808.
The previous prime is 21033113231303. The next prime is 21033113231327. The reversal of 21033113231311 is 11313231133012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21033113231311 - 23 = 21033113231303 is a prime.
It is a super-2 number, since 2×210331132313112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21033113231111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 169006116 + ... + 169130521.
It is an arithmetic number, because the mean of its divisors is an integer number (2784555213930).
Almost surely, 221033113231311 is an apocalyptic number.
21033113231311 is a deficient number, since it is larger than the sum of its proper divisors (1243328480129).
21033113231311 is a wasteful number, since it uses less digits than its factorization.
21033113231311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 338140313.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 21033113231311 its reverse (11313231133012), we get a palindrome (32346344364323).
The spelling of 21033113231311 in words is "twenty-one trillion, thirty-three billion, one hundred thirteen million, two hundred thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •