Base | Representation |
---|---|
bin | 111101000010100011… |
… | …0110010010001001101 |
3 | 110112100100020001011220 |
4 | 1322011012302101031 |
5 | 4121424013323443 |
6 | 140115053433553 |
7 | 12320224016163 |
oct | 1720506622115 |
9 | 415310201156 |
10 | 131082167373 |
11 | 50656514533 |
12 | 214a319b8b9 |
13 | c490150761 |
14 | 64b70c5233 |
15 | 3622d75a83 |
hex | 1e851b244d |
131082167373 has 16 divisors (see below), whose sum is σ = 184214373120. Its totient is φ = 82782749504.
The previous prime is 131082167357. The next prime is 131082167389. The reversal of 131082167373 is 373761280131.
It is an interprime number because it is at equal distance from previous prime (131082167357) and next prime (131082167389).
It is a cyclic number.
It is not a de Polignac number, because 131082167373 - 24 = 131082167357 is a prime.
It is a super-2 number, since 2×1310821673732 (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 (131082160373) 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, 14209461 + ... + 14218682.
It is an arithmetic number, because the mean of its divisors is an integer number (11513398320).
Almost surely, 2131082167373 is an apocalyptic number.
It is an amenable number.
131082167373 is a deficient number, since it is larger than the sum of its proper divisors (53132205747).
131082167373 is a wasteful number, since it uses less digits than its factorization.
131082167373 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28428228.
The product of its (nonzero) digits is 127008, while the sum is 42.
The spelling of 131082167373 in words is "one hundred thirty-one billion, eighty-two million, one hundred sixty-seven thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •