Base | Representation |
---|---|
bin | 100000010010100010010001… |
… | …001011010000011011010110 |
3 | 200121211010211002110002100020 |
4 | 200102202101023100123112 |
5 | 122103203001441302014 |
6 | 1222011021014330010 |
7 | 41624654525663652 |
oct | 4022422113203326 |
9 | 617733732402306 |
10 | 142011234322134 |
11 | 41281698605581 |
12 | 13b1688b059906 |
13 | 61317a95b2a58 |
14 | 270d547c05a62 |
15 | 11640888e21a9 |
hex | 8128912d06d6 |
142011234322134 has 8 divisors (see below), whose sum is σ = 284022468644280. Its totient is φ = 47337078107376.
The previous prime is 142011234322127. The next prime is 142011234322169. The reversal of 142011234322134 is 431223432110241.
It is a sphenic number, since it is the product of 3 distinct primes.
142011234322134 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 142011234322095 and 142011234322104.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11834269526839 + ... + 11834269526850.
It is an arithmetic number, because the mean of its divisors is an integer number (35502808580535).
Almost surely, 2142011234322134 is an apocalyptic number.
142011234322134 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.
142011234322134 is a wasteful number, since it uses less digits than its factorization.
142011234322134 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23668539053694.
The product of its (nonzero) digits is 27648, while the sum is 33.
Adding to 142011234322134 its reverse (431223432110241), we get a palindrome (573234666432375).
The spelling of 142011234322134 in words is "one hundred forty-two trillion, eleven billion, two hundred thirty-four million, three hundred twenty-two thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •