Base | Representation |
---|---|
bin | 11101110011110011100000… |
… | …001001001011001001111101 |
3 | 122012012100122100002200000001 |
4 | 131303303200021023021331 |
5 | 114140444121103310402 |
6 | 1142500013255234301 |
7 | 36420622016065141 |
oct | 3563634011131175 |
9 | 565170570080001 |
10 | 131103342244477 |
11 | 38856684926a39 |
12 | 12854858078991 |
13 | 581ccb8913ac5 |
14 | 24536154bb221 |
15 | 1025473694187 |
hex | 773ce024b27d |
131103342244477 has 2 divisors, whose sum is σ = 131103342244478. Its totient is φ = 131103342244476.
The previous prime is 131103342244463. The next prime is 131103342244573. The reversal of 131103342244477 is 774442243301131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 78867294287076 + 52236047957401 = 8880726^2 + 7227451^2 .
It is an emirp because it is prime and its reverse (774442243301131) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131103342244477 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131103342244577) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65551671122238 + 65551671122239.
It is an arithmetic number, because the mean of its divisors is an integer number (65551671122239).
Almost surely, 2131103342244477 is an apocalyptic number.
It is an amenable number.
131103342244477 is a deficient number, since it is larger than the sum of its proper divisors (1).
131103342244477 is an equidigital number, since it uses as much as digits as its factorization.
131103342244477 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1354752, while the sum is 46.
The spelling of 131103342244477 in words is "one hundred thirty-one trillion, one hundred three billion, three hundred forty-two million, two hundred forty-four thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •