Base | Representation |
---|---|
bin | 111110101000100000… |
… | …1000111101001011110 |
3 | 110212011202120020112112 |
4 | 1331101001013221132 |
5 | 4200430311443032 |
6 | 141442343034022 |
7 | 12501054424604 |
oct | 1752101075136 |
9 | 425152506475 |
10 | 134503234142 |
11 | 52051629642 |
12 | 22098a3b912 |
13 | c8b6b41414 |
14 | 671d5b7874 |
15 | 37733901b2 |
hex | 1f51047a5e |
134503234142 has 8 divisors (see below), whose sum is σ = 202304593056. Its totient is φ = 67068369792.
The previous prime is 134503234141. The next prime is 134503234183. The reversal of 134503234142 is 241432305431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1345032341422 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 134503234099 and 134503234108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134503234141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 91622723 + ... + 91624190.
It is an arithmetic number, because the mean of its divisors is an integer number (25288074132).
Almost surely, 2134503234142 is an apocalyptic number.
134503234142 is a deficient number, since it is larger than the sum of its proper divisors (67801358914).
134503234142 is a wasteful number, since it uses less digits than its factorization.
134503234142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183247282.
The product of its (nonzero) digits is 34560, while the sum is 32.
Adding to 134503234142 its reverse (241432305431), we get a palindrome (375935539573).
The spelling of 134503234142 in words is "one hundred thirty-four billion, five hundred three million, two hundred thirty-four thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •