Base | Representation |
---|---|
bin | 11101010001001100101… |
… | …011010100110001011101 |
3 | 21010021121010100101202101 |
4 | 131101030223110301131 |
5 | 230423201231321341 |
6 | 4135554234125101 |
7 | 265212442303003 |
oct | 35211453246135 |
9 | 7107533311671 |
10 | 2011331120221 |
11 | 706000a89155 |
12 | 285986880791 |
13 | 11788ac64637 |
14 | 6d4c5714a73 |
15 | 374bcb76831 |
hex | 1d44cad4c5d |
2011331120221 has 8 divisors (see below), whose sum is σ = 2012694085304. Its totient is φ = 2009968404480.
The previous prime is 2011331120213. The next prime is 2011331120237. The reversal of 2011331120221 is 1220211331102.
It can be written as a sum of positive squares in 4 ways, for example, as 53136704196 + 1958194416025 = 230514^2 + 1399355^2 .
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 2011331120221 - 23 = 2011331120213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011331120251) 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, 17783911 + ... + 17896651.
It is an arithmetic number, because the mean of its divisors is an integer number (251586760663).
Almost surely, 22011331120221 is an apocalyptic number.
It is an amenable number.
2011331120221 is a deficient number, since it is larger than the sum of its proper divisors (1362965083).
2011331120221 is a wasteful number, since it uses less digits than its factorization.
2011331120221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124671.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 2011331120221 its reverse (1220211331102), we get a palindrome (3231542451323).
The spelling of 2011331120221 in words is "two trillion, eleven billion, three hundred thirty-one million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •