Base | Representation |
---|---|
bin | 11101110010111100100111… |
… | …001111011111100111010110 |
3 | 122011222201111221021221022220 |
4 | 131302330213033133213112 |
5 | 114134012420304310314 |
6 | 1142412545133203210 |
7 | 36413434350266235 |
oct | 3562744717374726 |
9 | 564881457257286 |
10 | 131044405541334 |
11 | 3883369067560a |
12 | 1284534a330506 |
13 | 581758555656c |
14 | 2450823d30b1c |
15 | 1023b744773a9 |
hex | 772f273df9d6 |
131044405541334 has 8 divisors (see below), whose sum is σ = 262088811082680. Its totient is φ = 43681468513776.
The previous prime is 131044405541293. The next prime is 131044405541347. The reversal of 131044405541334 is 433145504440131.
It is a sphenic number, since it is the product of 3 distinct primes.
131044405541334 is an admirable number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10920367128439 + ... + 10920367128450.
It is an arithmetic number, because the mean of its divisors is an integer number (32761101385335).
Almost surely, 2131044405541334 is an apocalyptic number.
131044405541334 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131044405541334 is a wasteful number, since it uses less digits than its factorization.
131044405541334 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21840734256894.
The product of its (nonzero) digits is 691200, while the sum is 42.
Adding to 131044405541334 its reverse (433145504440131), we get a palindrome (564189909981465).
The spelling of 131044405541334 in words is "one hundred thirty-one trillion, forty-four billion, four hundred five million, five hundred forty-one thousand, three hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •