Base | Representation |
---|---|
bin | 11101110011000010100001… |
… | …010001000001111011111001 |
3 | 122012000022212221020120221120 |
4 | 131303002201101001323321 |
5 | 114134113412404403310 |
6 | 1142415514332255453 |
7 | 36414050461104204 |
oct | 3563024121017371 |
9 | 565008787216846 |
10 | 131050747731705 |
11 | 3883634567705a |
12 | 1284661a311589 |
13 | 58180564a2929 |
14 | 2450c6637693b |
15 | 1023de6154b70 |
hex | 7730a1441ef9 |
131050747731705 has 16 divisors (see below), whose sum is σ = 209703510227904. Its totient is φ = 69886294171200.
The previous prime is 131050747731691. The next prime is 131050747731719. The reversal of 131050747731705 is 507137747050131.
It is an interprime number because it is at equal distance from previous prime (131050747731691) and next prime (131050747731719).
It is not a de Polignac number, because 131050747731705 - 218 = 131050747469561 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 464726371 + ... + 465008280.
It is an arithmetic number, because the mean of its divisors is an integer number (13106469389244).
Almost surely, 2131050747731705 is an apocalyptic number.
131050747731705 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
131050747731705 is a deficient number, since it is larger than the sum of its proper divisors (78652762496199).
131050747731705 is an equidigital number, since it uses as much as digits as its factorization.
131050747731705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 929744056.
The product of its (nonzero) digits is 2160900, while the sum is 51.
The spelling of 131050747731705 in words is "one hundred thirty-one trillion, fifty billion, seven hundred forty-seven million, seven hundred thirty-one thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •