Base | Representation |
---|---|
bin | 10000000100000… |
… | …00101000000000 |
3 | 100101112201210212 |
4 | 20002000220000 |
5 | 233443311301 |
6 | 21212013252 |
7 | 3224211221 |
oct | 1002005000 |
9 | 311481725 |
10 | 134744576 |
11 | 6a07265a |
12 | 39161228 |
13 | 21bba225 |
14 | 13c77248 |
15 | bc694bb |
hex | 8080a00 |
134744576 has 40 divisors (see below), whose sum is σ = 272343060. Its totient is φ = 66592768.
The previous prime is 134744563. The next prime is 134744593. The reversal of 134744576 is 675447431.
It can be written as a sum of positive squares in 2 ways, for example, as 120121600 + 14622976 = 10960^2 + 3824^2 .
It is a super-2 number, since 2×1347445762 = 36312201522839552, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44090 + ... + 47046.
Almost surely, 2134744576 is an apocalyptic number.
134744576 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 134744576, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136171530).
134744576 is an abundant number, since it is smaller than the sum of its proper divisors (137598484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134744576 is an frugal number, since it uses more digits than its factorization.
134744576 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3064 (or 3048 counting only the distinct ones).
The product of its digits is 282240, while the sum is 41.
The square root of 134744576 is about 11607.9531356738. The cubic root of 134744576 is about 512.6690472282.
The spelling of 134744576 in words is "one hundred thirty-four million, seven hundred forty-four thousand, five hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •