Base | Representation |
---|---|
bin | 11101110010011110100111… |
… | …101010110010100100001001 |
3 | 122011212122101111201101111120 |
4 | 131302132213222302210021 |
5 | 114133000441303121441 |
6 | 1142350101330145453 |
7 | 36411214313412555 |
oct | 3562364752624411 |
9 | 564778344641446 |
10 | 131012200442121 |
11 | 38820a64739939 |
12 | 1283b060a22289 |
13 | 5814522395b3b |
14 | 244d04aabc865 |
15 | 1022ddbe75966 |
hex | 7727a7ab2909 |
131012200442121 has 8 divisors (see below), whose sum is σ = 175210676926944. Its totient is φ = 87077595459360.
The previous prime is 131012200442063. The next prime is 131012200442161. The reversal of 131012200442121 is 121244002210131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131012200442121 - 222 = 131012196247817 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131012200442091 and 131012200442100.
It is not an unprimeable number, because it can be changed into a prime (131012200442161) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65967874356 + ... + 65967876341.
It is an arithmetic number, because the mean of its divisors is an integer number (21901334615868).
Almost surely, 2131012200442121 is an apocalyptic number.
It is an amenable number.
131012200442121 is a deficient number, since it is larger than the sum of its proper divisors (44198476484823).
131012200442121 is a wasteful number, since it uses less digits than its factorization.
131012200442121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131935751031.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 131012200442121 its reverse (121244002210131), we get a palindrome (252256202652252).
The spelling of 131012200442121 in words is "one hundred thirty-one trillion, twelve billion, two hundred million, four hundred forty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •