Base | Representation |
---|---|
bin | 11101110100010110101100… |
… | …001011011111111110000101 |
3 | 122012022222011111021212000211 |
4 | 131310112230023133332011 |
5 | 114142104011014110303 |
6 | 1142525222354035421 |
7 | 36423430222326364 |
oct | 3564265413377605 |
9 | 565288144255024 |
10 | 131141125144453 |
11 | 38870703335a06 |
12 | 12860041578b71 |
13 | 582372a558558 |
14 | 245539b4397db |
15 | 10264356d266d |
hex | 7745ac2dff85 |
131141125144453 has 8 divisors (see below), whose sum is σ = 138922546250720. Its totient is φ = 123447629700720.
The previous prime is 131141125144451. The next prime is 131141125144489. The reversal of 131141125144453 is 354441521141131.
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 131141125144453 - 21 = 131141125144451 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 (131141125144451) 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, 21981412563 + ... + 21981418528.
It is an arithmetic number, because the mean of its divisors is an integer number (17365318281340).
Almost surely, 2131141125144453 is an apocalyptic number.
It is an amenable number.
131141125144453 is a deficient number, since it is larger than the sum of its proper divisors (7781421106267).
131141125144453 is a wasteful number, since it uses less digits than its factorization.
131141125144453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43962831267.
The product of its digits is 115200, while the sum is 40.
Adding to 131141125144453 its reverse (354441521141131), we get a palindrome (485582646285584).
The spelling of 131141125144453 in words is "one hundred thirty-one trillion, one hundred forty-one billion, one hundred twenty-five million, one hundred forty-four thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •