Base | Representation |
---|---|
bin | 10000000010011… |
… | …10110110011101 |
3 | 100101011101010221 |
4 | 20001032312131 |
5 | 233420300301 |
6 | 21203401341 |
7 | 3222401641 |
oct | 1001166635 |
9 | 311141127 |
10 | 134540701 |
11 | 69a43469 |
12 | 39083251 |
13 | 21b484a9 |
14 | 13c22c21 |
15 | bc28da1 |
hex | 804ed9d |
134540701 has 4 divisors (see below), whose sum is σ = 134655804. Its totient is φ = 134425600.
The previous prime is 134540699. The next prime is 134540719. The reversal of 134540701 is 107045431.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 107045431 = 67 ⋅1597693.
It can be written as a sum of positive squares in 2 ways, for example, as 84824100 + 49716601 = 9210^2 + 7051^2 .
It is a cyclic number.
It is not a de Polignac number, because 134540701 - 21 = 134540699 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134540761) 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 3 ways as a sum of consecutive naturals, for example, 55780 + ... + 58141.
It is an arithmetic number, because the mean of its divisors is an integer number (33663951).
Almost surely, 2134540701 is an apocalyptic number.
It is an amenable number.
134540701 is a deficient number, since it is larger than the sum of its proper divisors (115103).
134540701 is a wasteful number, since it uses less digits than its factorization.
134540701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115102.
The product of its (nonzero) digits is 1680, while the sum is 25.
The square root of 134540701 is about 11599.1681167229. The cubic root of 134540701 is about 512.4103524338.
The spelling of 134540701 in words is "one hundred thirty-four million, five hundred forty thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •