Base | Representation |
---|---|
bin | 11101101110001010111… |
… | …01101001100011110111 |
3 | 10121121221120211212201000 |
4 | 32313011131221203313 |
5 | 113212424323224421 |
6 | 2101050403334343 |
7 | 133531533623223 |
oct | 16670535514367 |
9 | 3547846755630 |
10 | 1021220133111 |
11 | 364108161a92 |
12 | 145b046813b3 |
13 | 753ba696819 |
14 | 375da7bd783 |
15 | 1b86e698226 |
hex | edc57698f7 |
1021220133111 has 8 divisors (see below), whose sum is σ = 1512918715760. Its totient is φ = 680813422056.
The previous prime is 1021220133107. The next prime is 1021220133149. The reversal of 1021220133111 is 1113310221201.
1021220133111 is a `hidden beast` number, since 102 + 1 + 220 + 1 + 331 + 11 = 666.
It is not a de Polignac number, because 1021220133111 - 22 = 1021220133107 is a prime.
It is a super-3 number, since 3×10212201331113 (a number of 37 digits) contains 333 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 (1021220133161) 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, 18911483920 + ... + 18911483973.
It is an arithmetic number, because the mean of its divisors is an integer number (189114839470).
Almost surely, 21021220133111 is an apocalyptic number.
1021220133111 is a deficient number, since it is larger than the sum of its proper divisors (491698582649).
1021220133111 is an equidigital number, since it uses as much as digits as its factorization.
1021220133111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37822967902 (or 37822967896 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 1021220133111 its reverse (1113310221201), we get a palindrome (2134530354312).
The spelling of 1021220133111 in words is "one trillion, twenty-one billion, two hundred twenty million, one hundred thirty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •