Base | Representation |
---|---|
bin | 1010001101101111001010… |
… | …0000100001000011100101 |
3 | 1110202200110120202201112110 |
4 | 2203123302200201003211 |
5 | 2433002304424401041 |
6 | 35515300243511233 |
7 | 2236264311254022 |
oct | 243336240410345 |
9 | 43680416681473 |
10 | 11231113122021 |
11 | 36400a76211a1 |
12 | 13147b9088519 |
13 | 6361216018b0 |
14 | 2ab835858549 |
15 | 147231331516 |
hex | a36f28210e5 |
11231113122021 has 16 divisors (see below), whose sum is σ = 16130882053440. Its totient is φ = 6909673292160.
The previous prime is 11231113122001. The next prime is 11231113122023. The reversal of 11231113122021 is 12022131113211.
It is not a de Polignac number, because 11231113122021 - 214 = 11231113105637 is a prime.
It is a super-2 number, since 2×112311131220212 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11231113122023) 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 15 ways as a sum of consecutive naturals, for example, 36949551 + ... + 37252268.
It is an arithmetic number, because the mean of its divisors is an integer number (1008180128340).
Almost surely, 211231113122021 is an apocalyptic number.
It is an amenable number.
11231113122021 is a deficient number, since it is larger than the sum of its proper divisors (4899768931419).
11231113122021 is a wasteful number, since it uses less digits than its factorization.
11231113122021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74205716.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 11231113122021 its reverse (12022131113211), we get a palindrome (23253244235232).
The spelling of 11231113122021 in words is "eleven trillion, two hundred thirty-one billion, one hundred thirteen million, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •