Base | Representation |
---|---|
bin | 111101000000100101… |
… | …1010111000010000111 |
3 | 110112011202012111001211 |
4 | 1322001023113002013 |
5 | 4121310130221141 |
6 | 140104341032251 |
7 | 12315463546465 |
oct | 1720113270207 |
9 | 415152174054 |
10 | 131016257671 |
11 | 50622297602 |
12 | 214850b5687 |
13 | c47c5b4930 |
14 | 64ac449835 |
15 | 361c1a6d81 |
hex | 1e812d7087 |
131016257671 has 16 divisors (see below), whose sum is σ = 148556903040. Its totient is φ = 114544804320.
The previous prime is 131016257657. The next prime is 131016257699. The reversal of 131016257671 is 176752610131.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131016257671 is a prime.
It is a super-2 number, since 2×1310162576712 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131016257651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 977136 + ... + 1103098.
It is an arithmetic number, because the mean of its divisors is an integer number (9284806440).
Almost surely, 2131016257671 is an apocalyptic number.
131016257671 is a deficient number, since it is larger than the sum of its proper divisors (17540645369).
131016257671 is a wasteful number, since it uses less digits than its factorization.
131016257671 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130206.
The product of its (nonzero) digits is 52920, while the sum is 40.
The spelling of 131016257671 in words is "one hundred thirty-one billion, sixteen million, two hundred fifty-seven thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •