Base | Representation |
---|---|
bin | 10000000000001… |
… | …10000011101101 |
3 | 100100121020010222 |
4 | 20000012003231 |
5 | 233331230131 |
6 | 21153141125 |
7 | 3220020446 |
oct | 1000060355 |
9 | 310536128 |
10 | 134242541 |
11 | 6985a454 |
12 | 38b5a7a5 |
13 | 21a72874 |
14 | 13b862cd |
15 | bbba87b |
hex | 80060ed |
134242541 has 4 divisors (see below), whose sum is σ = 134460732. Its totient is φ = 134024352.
The previous prime is 134242519. The next prime is 134242553. The reversal of 134242541 is 145242431.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 21436900 + 112805641 = 4630^2 + 10621^2 .
It is a cyclic number.
It is not a de Polignac number, because 134242541 - 218 = 133980397 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 134242541.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134242571) 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, 108170 + ... + 109403.
It is an arithmetic number, because the mean of its divisors is an integer number (33615183).
Almost surely, 2134242541 is an apocalyptic number.
It is an amenable number.
134242541 is a deficient number, since it is larger than the sum of its proper divisors (218191).
134242541 is an equidigital number, since it uses as much as digits as its factorization.
134242541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218190.
The product of its digits is 3840, while the sum is 26.
The square root of 134242541 is about 11586.3083421770. The cubic root of 134242541 is about 512.0315494170.
Adding to 134242541 its reverse (145242431), we get a palindrome (279484972).
The spelling of 134242541 in words is "one hundred thirty-four million, two hundred forty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •