Base | Representation |
---|---|
bin | 11101110011110001100010… |
… | …010111011010111101011011 |
3 | 122012012011012021101200101110 |
4 | 131303301202113122331123 |
5 | 114140430310401100021 |
6 | 1142455024034351403 |
7 | 36420515513531526 |
oct | 3563614227327533 |
9 | 565164167350343 |
10 | 131101232050011 |
11 | 388557a1765673 |
12 | 1285436942b563 |
13 | 581ca40696a22 |
14 | 2453495139bbd |
15 | 102539d2b6476 |
hex | 773c625daf5b |
131101232050011 has 16 divisors (see below), whose sum is σ = 178130134052640. Its totient is φ = 85737137690880.
The previous prime is 131101232050007. The next prime is 131101232050027. The reversal of 131101232050011 is 110050232101131.
It is not a de Polignac number, because 131101232050011 - 22 = 131101232050007 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131101232050011.
It is not an unprimeable number, because it can be changed into a prime (131101232050091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 69311850 + ... + 71178191.
It is an arithmetic number, because the mean of its divisors is an integer number (11133133378290).
Almost surely, 2131101232050011 is an apocalyptic number.
131101232050011 is a deficient number, since it is larger than the sum of its proper divisors (47028902002629).
131101232050011 is a wasteful number, since it uses less digits than its factorization.
131101232050011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140495966.
The product of its (nonzero) digits is 180, while the sum is 21.
Adding to 131101232050011 its reverse (110050232101131), we get a palindrome (241151464151142).
The spelling of 131101232050011 in words is "one hundred thirty-one trillion, one hundred one billion, two hundred thirty-two million, fifty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •