Base | Representation |
---|---|
bin | 111101000000011011… |
… | …1010110001000110001 |
3 | 110112011101022221011011 |
4 | 1322000313112020301 |
5 | 4121302304323441 |
6 | 140104032350521 |
7 | 12315401135434 |
oct | 1720067261061 |
9 | 415141287134 |
10 | 131011011121 |
11 | 5061a333811 |
12 | 214833a5441 |
13 | c47b498873 |
14 | 64ab88181b |
15 | 361b9bc581 |
hex | 1e80dd6231 |
131011011121 has 8 divisors (see below), whose sum is σ = 131879599488. Its totient is φ = 130144014000.
The previous prime is 131011011017. The next prime is 131011011133. The reversal of 131011011121 is 121110110131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131011011121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131011011721) 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 7 ways as a sum of consecutive naturals, for example, 232375 + ... + 562156.
It is an arithmetic number, because the mean of its divisors is an integer number (16484949936).
Almost surely, 2131011011121 is an apocalyptic number.
It is an amenable number.
131011011121 is a deficient number, since it is larger than the sum of its proper divisors (868588367).
131011011121 is an equidigital number, since it uses as much as digits as its factorization.
131011011121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 795623.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 131011011121 its reverse (121110110131), we get a palindrome (252121121252).
It can be divided in two parts, 1310110 and 11121, that added together give a palindrome (1321231).
The spelling of 131011011121 in words is "one hundred thirty-one billion, eleven million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.152 sec. • engine limits •