Base | Representation |
---|---|
bin | 10000000011111… |
… | …11110110000001 |
3 | 100101112120102101 |
4 | 20001333312001 |
5 | 233443211002 |
6 | 21211550401 |
7 | 3224166001 |
oct | 1001776601 |
9 | 311476371 |
10 | 134741377 |
11 | 6a070211 |
12 | 3915b401 |
13 | 21bb8934 |
14 | 13c76001 |
15 | bc68587 |
hex | 807fd81 |
134741377 has 8 divisors (see below), whose sum is σ = 135924480. Its totient is φ = 133562400.
The previous prime is 134741363. The next prime is 134741381. The reversal of 134741377 is 773147431.
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 134741377 - 211 = 134739329 is a prime.
It is a super-2 number, since 2×1347413772 = 36310477351712258, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134741357) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 121608 + ... + 122710.
It is an arithmetic number, because the mean of its divisors is an integer number (16990560).
Almost surely, 2134741377 is an apocalyptic number.
It is an amenable number.
134741377 is a deficient number, since it is larger than the sum of its proper divisors (1183103).
134741377 is a wasteful number, since it uses less digits than its factorization.
134741377 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2063.
The product of its digits is 49392, while the sum is 37.
The square root of 134741377 is about 11607.8153413982. The cubic root of 134741377 is about 512.6649900673.
It can be divided in two parts, 1347 and 41377, that added together give a palindrome (42724).
The spelling of 134741377 in words is "one hundred thirty-four million, seven hundred forty-one thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •