Base | Representation |
---|---|
bin | 11101111001101010111111… |
… | …011011100110001011011011 |
3 | 122020121220022111211121011120 |
4 | 131321222333123212023123 |
5 | 114214100323202221301 |
6 | 1143405132245300323 |
7 | 36462014111334150 |
oct | 3571527733461333 |
9 | 566556274747146 |
10 | 131506520351451 |
11 | 389a1669409123 |
12 | 128baa177046a3 |
13 | 584c01c7c69cb |
14 | 2468d417aa227 |
15 | 1030bbe0b3e36 |
hex | 779abf6e62db |
131506520351451 has 32 divisors (see below), whose sum is σ = 200584294609920. Its totient is φ = 75074065059456.
The previous prime is 131506520351443. The next prime is 131506520351573. The reversal of 131506520351451 is 154153025605131.
It is not a de Polignac number, because 131506520351451 - 23 = 131506520351443 is a prime.
It is not an unprimeable number, because it can be changed into a prime (131506520351431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 349016065 + ... + 349392653.
It is an arithmetic number, because the mean of its divisors is an integer number (6268259206560).
Almost surely, 2131506520351451 is an apocalyptic number.
131506520351451 is a deficient number, since it is larger than the sum of its proper divisors (69077774258469).
131506520351451 is a wasteful number, since it uses less digits than its factorization.
131506520351451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 392603.
The product of its (nonzero) digits is 270000, while the sum is 42.
Adding to 131506520351451 its reverse (154153025605131), we get a palindrome (285659545956582).
The spelling of 131506520351451 in words is "one hundred thirty-one trillion, five hundred six billion, five hundred twenty million, three hundred fifty-one thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •