Base | Representation |
---|---|
bin | 11101111100101101110001… |
… | …011111111101101110110101 |
3 | 122021100220011020210010212212 |
4 | 131330231301133331232311 |
5 | 114231012141031134112 |
6 | 1144045201452223205 |
7 | 36513066666326123 |
oct | 3574556137755665 |
9 | 567326136703785 |
10 | 131715666271157 |
11 | 38a72333876151 |
12 | 1293346616ab05 |
13 | 5865970896a97 |
14 | 2475102408913 |
15 | 103636043a522 |
hex | 77cb717fdbb5 |
131715666271157 has 8 divisors (see below), whose sum is σ = 132995826797184. Its totient is φ = 130435532046288.
The previous prime is 131715666271151. The next prime is 131715666271177. The reversal of 131715666271157 is 751172666517131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131715666271157 - 26 = 131715666271093 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131715666271096 and 131715666271105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131715666271151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3564968 + ... + 16617470.
It is an arithmetic number, because the mean of its divisors is an integer number (16624478349648).
Almost surely, 2131715666271157 is an apocalyptic number.
It is an amenable number.
131715666271157 is a deficient number, since it is larger than the sum of its proper divisors (1280160526027).
131715666271157 is a wasteful number, since it uses less digits than its factorization.
131715666271157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13150579.
The product of its digits is 11113200, while the sum is 59.
The spelling of 131715666271157 in words is "one hundred thirty-one trillion, seven hundred fifteen billion, six hundred sixty-six million, two hundred seventy-one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •