Base | Representation |
---|---|
bin | 11101110100100010110111… |
… | …100101010001000110101101 |
3 | 122012101012220210110221122012 |
4 | 131310202313211101012231 |
5 | 114142312301021204243 |
6 | 1142535224110331005 |
7 | 36424402242256322 |
oct | 3564426745210655 |
9 | 565335823427565 |
10 | 131154201350573 |
11 | 38876203530125 |
12 | 128626907b9a65 |
13 | 5824a3265c81b |
14 | 2455c7bd60b49 |
15 | 102694d688d18 |
hex | 7748b79511ad |
131154201350573 has 2 divisors, whose sum is σ = 131154201350574. Its totient is φ = 131154201350572.
The previous prime is 131154201350509. The next prime is 131154201350587. The reversal of 131154201350573 is 375053102451131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 130466607151204 + 687594199369 = 11422198^2 + 829213^2 .
It is a cyclic number.
It is not a de Polignac number, because 131154201350573 - 26 = 131154201350509 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131154201350573.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131154201320573) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65577100675286 + 65577100675287.
It is an arithmetic number, because the mean of its divisors is an integer number (65577100675287).
Almost surely, 2131154201350573 is an apocalyptic number.
It is an amenable number.
131154201350573 is a deficient number, since it is larger than the sum of its proper divisors (1).
131154201350573 is an equidigital number, since it uses as much as digits as its factorization.
131154201350573 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 189000, while the sum is 41.
The spelling of 131154201350573 in words is "one hundred thirty-one trillion, one hundred fifty-four billion, two hundred one million, three hundred fifty thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •