Base | Representation |
---|---|
bin | 11101010001001100101… |
… | …011010100110000000011 |
3 | 21010021121010100101122001 |
4 | 131101030223110300003 |
5 | 230423201231321011 |
6 | 4135554234124431 |
7 | 265212442302514 |
oct | 35211453246003 |
9 | 7107533311561 |
10 | 2011331120131 |
11 | 706000a89083 |
12 | 285986880717 |
13 | 11788ac64598 |
14 | 6d4c5714a0b |
15 | 374bcb767c1 |
hex | 1d44cad4c03 |
2011331120131 has 4 divisors (see below), whose sum is σ = 2011384268064. Its totient is φ = 2011277972200.
The previous prime is 2011331120111. The next prime is 2011331120137. The reversal of 2011331120131 is 1310211331102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2011331120131 - 231 = 2009183636483 is a prime.
It is a super-2 number, since 2×20113311201312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2011331120099 and 2011331120108.
It is not an unprimeable number, because it can be changed into a prime (2011331120137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26517160 + ... + 26592901.
It is an arithmetic number, because the mean of its divisors is an integer number (502846067016).
Almost surely, 22011331120131 is an apocalyptic number.
2011331120131 is a deficient number, since it is larger than the sum of its proper divisors (53147933).
2011331120131 is an equidigital number, since it uses as much as digits as its factorization.
2011331120131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53147932.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 2011331120131 its reverse (1310211331102), we get a palindrome (3321542451233).
The spelling of 2011331120131 in words is "two trillion, eleven billion, three hundred thirty-one million, one hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •