Base | Representation |
---|---|
bin | 11101110100010101110111… |
… | …011111010101111111011101 |
3 | 122012022212212212220111010011 |
4 | 131310111313133111333131 |
5 | 114142100203213412023 |
6 | 1142524554535043221 |
7 | 36423366266456650 |
oct | 3564256737257735 |
9 | 565285785814104 |
10 | 131140241154013 |
11 | 3887029a3488a3 |
12 | 1285ba35510511 |
13 | 5823619378ba0 |
14 | 2455315c89897 |
15 | 10263d2cb950d |
hex | 7745777d5fdd |
131140241154013 has 16 divisors (see below), whose sum is σ = 170897689831680. Its totient is φ = 97655822758656.
The previous prime is 131140241153953. The next prime is 131140241154019. The reversal of 131140241154013 is 310451142041131.
It is a cyclic number.
It is not a de Polignac number, because 131140241154013 - 225 = 131140207599581 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131140241154019) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42385338193 + ... + 42385341286.
It is an arithmetic number, because the mean of its divisors is an integer number (10681105614480).
Almost surely, 2131140241154013 is an apocalyptic number.
131140241154013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
131140241154013 is a deficient number, since it is larger than the sum of its proper divisors (39757448677667).
131140241154013 is a wasteful number, since it uses less digits than its factorization.
131140241154013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84770679516.
The product of its (nonzero) digits is 5760, while the sum is 31.
Adding to 131140241154013 its reverse (310451142041131), we get a palindrome (441591383195144).
The spelling of 131140241154013 in words is "one hundred thirty-one trillion, one hundred forty billion, two hundred forty-one million, one hundred fifty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •