Base | Representation |
---|---|
bin | 111101000100110110… |
… | …1110110100100100111 |
3 | 110112112201202211120122 |
4 | 1322021231312210213 |
5 | 4122103314024404 |
6 | 140130455352155 |
7 | 12322153334534 |
oct | 1721155664447 |
9 | 415481684518 |
10 | 131159517479 |
11 | 50696145841 |
12 | 2150508265b |
13 | c4a3193953 |
14 | 64c349bd8b |
15 | 3629a543be |
hex | 1e89b76927 |
131159517479 has 2 divisors, whose sum is σ = 131159517480. Its totient is φ = 131159517478.
The previous prime is 131159517421. The next prime is 131159517497. The reversal of 131159517479 is 974715951131.
Together with next prime (131159517497) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131159517479 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131159517479.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131159517179) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65579758739 + 65579758740.
It is an arithmetic number, because the mean of its divisors is an integer number (65579758740).
Almost surely, 2131159517479 is an apocalyptic number.
131159517479 is a deficient number, since it is larger than the sum of its proper divisors (1).
131159517479 is an equidigital number, since it uses as much as digits as its factorization.
131159517479 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1190700, while the sum is 53.
The spelling of 131159517479 in words is "one hundred thirty-one billion, one hundred fifty-nine million, five hundred seventeen thousand, four hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •