Base | Representation |
---|---|
bin | 11101110010011110100111… |
… | …101001001011110000100111 |
3 | 122011212122101110220222212122 |
4 | 131302132213221023300213 |
5 | 114133000441201133111 |
6 | 1142350101313140155 |
7 | 36411214310010110 |
oct | 3562364751136047 |
9 | 564778343828778 |
10 | 131012200021031 |
11 | 38820a6448152a |
12 | 1283b06085a65b |
13 | 5814522279284 |
14 | 244d04aa0d207 |
15 | 1022ddbde0cdb |
hex | 7727a7a4bc27 |
131012200021031 has 4 divisors (see below), whose sum is σ = 149728228595472. Its totient is φ = 112296171446592.
The previous prime is 131012200020997. The next prime is 131012200021037. The reversal of 131012200021031 is 130120002210131.
It is a semiprime because it is the product of two primes.
It is a de Polignac number, because none of the positive numbers 2k-131012200021031 is a prime.
It is a super-2 number, since 2×1310122000210312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131012200021037) 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, 9358014287210 + ... + 9358014287223.
It is an arithmetic number, because the mean of its divisors is an integer number (37432057148868).
Almost surely, 2131012200021031 is an apocalyptic number.
131012200021031 is a deficient number, since it is larger than the sum of its proper divisors (18716028574441).
131012200021031 is an equidigital number, since it uses as much as digits as its factorization.
131012200021031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18716028574440.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 131012200021031 its reverse (130120002210131), we get a palindrome (261132202231162).
The spelling of 131012200021031 in words is "one hundred thirty-one trillion, twelve billion, two hundred million, twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •