Base | Representation |
---|---|
bin | 11101110010100000011100… |
… | …110101100100000010110101 |
3 | 122011212211110111122021001111 |
4 | 131302200130311210002311 |
5 | 114133014003021404001 |
6 | 1142351024351155021 |
7 | 36411314113161553 |
oct | 3562403465440265 |
9 | 564784414567044 |
10 | 131014166200501 |
11 | 38821883319241 |
12 | 1283b50b215a71 |
13 | 581477671168c |
14 | 244d195bc2bd3 |
15 | 1022ea4822851 |
hex | 77281cd640b5 |
131014166200501 has 8 divisors (see below), whose sum is σ = 138738970520280. Its totient is φ = 123291371731968.
The previous prime is 131014166200499. The next prime is 131014166200529. The reversal of 131014166200501 is 105002661410131.
It can be written as a sum of positive squares in 4 ways, for example, as 40923221059876 + 90090945140625 = 6397126^2 + 9491625^2 .
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 131014166200501 - 21 = 131014166200499 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131014166207501) 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, 502328596 + ... + 502589341.
It is an arithmetic number, because the mean of its divisors is an integer number (17342371315035).
Almost surely, 2131014166200501 is an apocalyptic number.
It is an amenable number.
131014166200501 is a deficient number, since it is larger than the sum of its proper divisors (7724804319779).
131014166200501 is a wasteful number, since it uses less digits than its factorization.
131014166200501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1004925623.
The product of its (nonzero) digits is 4320, while the sum is 31.
The spelling of 131014166200501 in words is "one hundred thirty-one trillion, fourteen billion, one hundred sixty-six million, two hundred thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •