Base | Representation |
---|---|
bin | 11101110100010110101011… |
… | …011110000011001010111011 |
3 | 122012022222010122212112111012 |
4 | 131310112223132003022323 |
5 | 114142103444441330021 |
6 | 1142525221250424135 |
7 | 36423430016134403 |
oct | 3564265336031273 |
9 | 565288118775435 |
10 | 131141113230011 |
11 | 388706a7638465 |
12 | 1286003959204b |
13 | 5823727c464a1 |
14 | 2455399a17803 |
15 | 102643462c35b |
hex | 7745ab7832bb |
131141113230011 has 4 divisors (see below), whose sum is σ = 135663220582800. Its totient is φ = 126619005877224.
The previous prime is 131141113229957. The next prime is 131141113230053. The reversal of 131141113230011 is 110032311141131.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 131141113230011 - 226 = 131141046121147 is a prime.
It is a super-2 number, since 2×1311411132300112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131141113238011) 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, 2261053676351 + ... + 2261053676408.
It is an arithmetic number, because the mean of its divisors is an integer number (33915805145700).
Almost surely, 2131141113230011 is an apocalyptic number.
131141113230011 is a deficient number, since it is larger than the sum of its proper divisors (4522107352789).
131141113230011 is an equidigital number, since it uses as much as digits as its factorization.
131141113230011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4522107352788.
The product of its (nonzero) digits is 216, while the sum is 23.
Adding to 131141113230011 its reverse (110032311141131), we get a palindrome (241173424371142).
The spelling of 131141113230011 in words is "one hundred thirty-one trillion, one hundred forty-one billion, one hundred thirteen million, two hundred thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •