Base | Representation |
---|---|
bin | 111101000100010011… |
… | …1110000001010001011 |
3 | 110112111110012012222011 |
4 | 1322020213300022023 |
5 | 4122034113004011 |
6 | 140125001440351 |
7 | 12321541210300 |
oct | 1721047601213 |
9 | 415443165864 |
10 | 131141141131 |
11 | 50686834380 |
12 | 214baaa00b7 |
13 | c49c42b580 |
14 | 64c0c770a7 |
15 | 3628124621 |
hex | 1e889f028b |
131141141131 has 48 divisors (see below), whose sum is σ = 179766494208. Its totient is φ = 94040654400.
The previous prime is 131141141111. The next prime is 131141141171.
131141141131 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 131141141131 - 231 = 128993657483 is a prime.
It is a super-2 number, since 2×1311411411312 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (131141141101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2291046 + ... + 2347588.
It is an arithmetic number, because the mean of its divisors is an integer number (3745135296).
Almost surely, 2131141141131 is an apocalyptic number.
131141141131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
131141141131 is a deficient number, since it is larger than the sum of its proper divisors (48625353077).
131141141131 is a wasteful number, since it uses less digits than its factorization.
131141141131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56912 (or 56905 counting only the distinct ones).
The product of its digits is 144, while the sum is 22.
It can be divided in two parts, 131141 and 141131, that added together give a palindrome (272272).
The spelling of 131141141131 in words is "one hundred thirty-one billion, one hundred forty-one million, one hundred forty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •