Base | Representation |
---|---|
bin | 11101110011001001011001… |
… | …010111001000010010011111 |
3 | 122012001000221111202000020112 |
4 | 131303021121113020102133 |
5 | 114134224023103240011 |
6 | 1142423135132040235 |
7 | 36414431445332615 |
oct | 3563113127102237 |
9 | 565030844660215 |
10 | 131058131305631 |
11 | 38839494497472 |
12 | 12847b3b00307b |
13 | 58189620b869a |
14 | 2451366c1d6b5 |
15 | 10241c948a58b |
hex | 7732595c849f |
131058131305631 has 4 divisors (see below), whose sum is σ = 131058506301000. Its totient is φ = 131057756310264.
The previous prime is 131058131305613. The next prime is 131058131305669. The reversal of 131058131305631 is 136503131850131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 131058131305631 - 238 = 130783253398687 is a prime.
It is a super-3 number, since 3×1310581313056313 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131058131305601) 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, 186972956 + ... + 187672593.
It is an arithmetic number, because the mean of its divisors is an integer number (32764626575250).
Almost surely, 2131058131305631 is an apocalyptic number.
131058131305631 is a deficient number, since it is larger than the sum of its proper divisors (374995369).
131058131305631 is an equidigital number, since it uses as much as digits as its factorization.
131058131305631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374995368.
The product of its (nonzero) digits is 97200, while the sum is 41.
The spelling of 131058131305631 in words is "one hundred thirty-one trillion, fifty-eight billion, one hundred thirty-one million, three hundred five thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •