Base | Representation |
---|---|
bin | 1111111111000… |
… | …11110001111111 |
3 | 100100100002120001 |
4 | 13333203301333 |
5 | 233312232033 |
6 | 21150135131 |
7 | 3215564230 |
oct | 777436177 |
9 | 310302501 |
10 | 134102143 |
11 | 69773a1a |
12 | 38ab14a7 |
13 | 21a239a6 |
14 | 13b4b087 |
15 | bb8de7d |
hex | 7fe3c7f |
134102143 has 4 divisors (see below), whose sum is σ = 153259600. Its totient is φ = 114944688.
The previous prime is 134102141. The next prime is 134102159. The reversal of 134102143 is 341201431.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 341201431 = 43 ⋅7934917.
It is a cyclic number.
It is not a de Polignac number, because 134102143 - 21 = 134102141 is a prime.
It is a Duffinian number.
It is a zygodrome in base 2.
It is a self number, because there is not a number n which added to its sum of digits gives 134102143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134102141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9578718 + ... + 9578731.
It is an arithmetic number, because the mean of its divisors is an integer number (38314900).
Almost surely, 2134102143 is an apocalyptic number.
134102143 is a deficient number, since it is larger than the sum of its proper divisors (19157457).
134102143 is an equidigital number, since it uses as much as digits as its factorization.
134102143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19157456.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 134102143 is about 11580.2479679841. The cubic root of 134102143 is about 511.8529838619.
Adding to 134102143 its reverse (341201431), we get a palindrome (475303574).
The spelling of 134102143 in words is "one hundred thirty-four million, one hundred two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •