Base | Representation |
---|---|
bin | 11101110011000101000111… |
… | …110100011001010001111101 |
3 | 122012000121002200012011011211 |
4 | 131303011013310121101331 |
5 | 114134140123224121341 |
6 | 1142421055511444421 |
7 | 36414206641134022 |
oct | 3563050764312175 |
9 | 565017080164154 |
10 | 131053542020221 |
11 | 38837549a03407 |
12 | 1284707a086711 |
13 | 58183b03802a2 |
14 | 245104d511549 |
15 | 102400b612181 |
hex | 773147d1947d |
131053542020221 has 8 divisors (see below), whose sum is σ = 135100470533760. Its totient is φ = 127067469574752.
The previous prime is 131053542020213. The next prime is 131053542020243. The reversal of 131053542020221 is 122020245350131.
It is a happy number.
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 131053542020221 - 23 = 131053542020213 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 (131053542020321) 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, 15214012645 + ... + 15214021258.
It is an arithmetic number, because the mean of its divisors is an integer number (16887558816720).
Almost surely, 2131053542020221 is an apocalyptic number.
It is an amenable number.
131053542020221 is a deficient number, since it is larger than the sum of its proper divisors (4046928513539).
131053542020221 is an equidigital number, since it uses as much as digits as its factorization.
131053542020221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30428034035.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 131053542020221 its reverse (122020245350131), we get a palindrome (253073787370352).
The spelling of 131053542020221 in words is "one hundred thirty-one trillion, fifty-three billion, five hundred forty-two million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •