Base | Representation |
---|---|
bin | 11101110010111100011110… |
… | …000010011100011100110001 |
3 | 122011222201010011201210200220 |
4 | 131302330132002130130301 |
5 | 114134012111242004203 |
6 | 1142412521535403253 |
7 | 36413430463625403 |
oct | 3562743602343461 |
9 | 564881104653626 |
10 | 131044251125553 |
11 | 38833611497767 |
12 | 12845306683529 |
13 | 581755c56c78c |
14 | 245080b616b73 |
15 | 1023b65b24653 |
hex | 772f1e09c731 |
131044251125553 has 8 divisors (see below), whose sum is σ = 174725741343648. Its totient is φ = 87362797495584.
The previous prime is 131044251125537. The next prime is 131044251125591. The reversal of 131044251125553 is 355521152440131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131044251125553 - 24 = 131044251125537 is a prime.
It is not an unprimeable number, because it can be changed into a prime (131044251125453) 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, 735301 + ... + 16205837.
It is an arithmetic number, because the mean of its divisors is an integer number (21840717667956).
Almost surely, 2131044251125553 is an apocalyptic number.
It is an amenable number.
131044251125553 is a deficient number, since it is larger than the sum of its proper divisors (43681490218095).
131044251125553 is a wasteful number, since it uses less digits than its factorization.
131044251125553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18294063.
The product of its (nonzero) digits is 360000, while the sum is 42.
The spelling of 131044251125553 in words is "one hundred thirty-one trillion, forty-four billion, two hundred fifty-one million, one hundred twenty-five thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •