Base | Representation |
---|---|
bin | 10000000101000… |
… | …01101110001101 |
3 | 100101210121202210 |
4 | 20002201232031 |
5 | 234012131031 |
6 | 21214541033 |
7 | 3225314364 |
oct | 1002415615 |
9 | 311717683 |
10 | 134880141 |
11 | 6a1554a0 |
12 | 39207779 |
13 | 21c36b46 |
14 | 13cb07db |
15 | bc94746 |
hex | 80a1b8d |
134880141 has 8 divisors (see below), whose sum is σ = 196189344. Its totient is φ = 81745520.
The previous prime is 134880139. The next prime is 134880167. The reversal of 134880141 is 141088431.
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 134880141 - 21 = 134880139 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 134880099 and 134880108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134880041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2043606 + ... + 2043671.
It is an arithmetic number, because the mean of its divisors is an integer number (24523668).
Almost surely, 2134880141 is an apocalyptic number.
134880141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
134880141 is a deficient number, since it is larger than the sum of its proper divisors (61309203).
134880141 is a wasteful number, since it uses less digits than its factorization.
134880141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4087291.
The product of its (nonzero) digits is 3072, while the sum is 30.
The square root of 134880141 is about 11613.7909831372. The cubic root of 134880141 is about 512.8409197858.
The spelling of 134880141 in words is "one hundred thirty-four million, eight hundred eighty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.945 sec. • engine limits •