Base | Representation |
---|---|
bin | 111101001010010001… |
… | …0111011001001101111 |
3 | 110120000101122100221010 |
4 | 1322110202323021233 |
5 | 4122441321431111 |
6 | 140200505440303 |
7 | 12326520540234 |
oct | 1722442731157 |
9 | 416011570833 |
10 | 131341202031 |
11 | 50779759066 |
12 | 21555aa0093 |
13 | c501a074c0 |
14 | 64dd67378b |
15 | 363a991aa6 |
hex | 1e948bb26f |
131341202031 has 8 divisors (see below), whose sum is σ = 188592495280. Its totient is φ = 80825355072.
The previous prime is 131341202023. The next prime is 131341202033. The reversal of 131341202031 is 130202143131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131341202031 - 23 = 131341202023 is a prime.
It is a super-2 number, since 2×1313412020312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131341201989 and 131341202007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131341202033) 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, 1683861526 + ... + 1683861603.
It is an arithmetic number, because the mean of its divisors is an integer number (23574061910).
Almost surely, 2131341202031 is an apocalyptic number.
131341202031 is a deficient number, since it is larger than the sum of its proper divisors (57251293249).
131341202031 is a wasteful number, since it uses less digits than its factorization.
131341202031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3367723145.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 131341202031 its reverse (130202143131), we get a palindrome (261543345162).
The spelling of 131341202031 in words is "one hundred thirty-one billion, three hundred forty-one million, two hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •