Base | Representation |
---|---|
bin | 11101010000111010001… |
… | …100010110100010111101 |
3 | 21010020210111211020001121 |
4 | 131100322030112202331 |
5 | 230422032334324013 |
6 | 4135503355310541 |
7 | 265201655360611 |
oct | 35207214264275 |
9 | 7106714736047 |
10 | 2011021011133 |
11 | 705961a2a652 |
12 | 2858baa4b451 |
13 | 11783b937434 |
14 | 6d49646d341 |
15 | 374a081c58d |
hex | 1d43a3168bd |
2011021011133 has 2 divisors, whose sum is σ = 2011021011134. Its totient is φ = 2011021011132.
The previous prime is 2011021011079. The next prime is 2011021011137. The reversal of 2011021011133 is 3311101201102.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1823291185849 + 187729825284 = 1350293^2 + 433278^2 .
It is a cyclic number.
It is not a de Polignac number, because 2011021011133 - 229 = 2010484140221 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2011021011137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005510505566 + 1005510505567.
It is an arithmetic number, because the mean of its divisors is an integer number (1005510505567).
Almost surely, 22011021011133 is an apocalyptic number.
It is an amenable number.
2011021011133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011021011133 is an equidigital number, since it uses as much as digits as its factorization.
2011021011133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 2011021011133 its reverse (3311101201102), we get a palindrome (5322122212235).
The spelling of 2011021011133 in words is "two trillion, eleven billion, twenty-one million, eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •