Base | Representation |
---|---|
bin | 11101110010011110100111… |
… | …101001001100010001011011 |
3 | 122011212122101110221002202102 |
4 | 131302132213221030101123 |
5 | 114133000441201220011 |
6 | 1142350101313154015 |
7 | 36411214310016200 |
oct | 3562364751142133 |
9 | 564778343832672 |
10 | 131012200023131 |
11 | 38820a64483069 |
12 | 1283b06085b90b |
13 | 581452227a20b |
14 | 244d04aa0dca7 |
15 | 1022ddbde173b |
hex | 7727a7a4c45b |
131012200023131 has 12 divisors (see below), whose sum is σ = 152411101734600. Its totient is φ = 112289425829280.
The previous prime is 131012200023113. The next prime is 131012200023181. The reversal of 131012200023131 is 131320002210131.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-131012200023131 is a prime.
It is a super-2 number, since 2×1310122000231312 (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 (131012200023181) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 79480865 + ... + 81112466.
It is an arithmetic number, because the mean of its divisors is an integer number (12700925144550).
Almost surely, 2131012200023131 is an apocalyptic number.
131012200023131 is a deficient number, since it is larger than the sum of its proper divisors (21398901711469).
131012200023131 is a wasteful number, since it uses less digits than its factorization.
131012200023131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160609994 (or 160609987 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 131012200023131 its reverse (131320002210131), we get a palindrome (262332202233262).
The spelling of 131012200023131 in words is "one hundred thirty-one trillion, twelve billion, two hundred million, twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •