Base | Representation |
---|---|
bin | 111110100000110000… |
… | …1101001000011101111 |
3 | 110211111122111110001021 |
4 | 1331001201221003233 |
5 | 4144412242333033 |
6 | 141400500155011 |
7 | 12461450266525 |
oct | 1750141510357 |
9 | 424448443037 |
10 | 134243324143 |
11 | 51a28947395 |
12 | 22025998a67 |
13 | c87503c116 |
14 | 66d6c7c315 |
15 | 375a64eb2d |
hex | 1f418690ef |
134243324143 has 8 divisors (see below), whose sum is σ = 135235760400. Its totient is φ = 133252107840.
The previous prime is 134243324107. The next prime is 134243324219. The reversal of 134243324143 is 341423342431.
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 134243324143 - 29 = 134243323631 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 134243324099 and 134243324108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134243324543) 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 7 ways as a sum of consecutive naturals, for example, 83505 + ... + 524842.
It is an arithmetic number, because the mean of its divisors is an integer number (16904470050).
Almost surely, 2134243324143 is an apocalyptic number.
134243324143 is a deficient number, since it is larger than the sum of its proper divisors (992436257).
134243324143 is a wasteful number, since it uses less digits than its factorization.
134243324143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 609977.
The product of its digits is 82944, while the sum is 34.
Adding to 134243324143 its reverse (341423342431), we get a palindrome (475666666574).
The spelling of 134243324143 in words is "one hundred thirty-four billion, two hundred forty-three million, three hundred twenty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •