Base | Representation |
---|---|
bin | 10000000010010… |
… | …00111100000000 |
3 | 100101010010220212 |
4 | 20001020330000 |
5 | 233414011410 |
6 | 21203053252 |
7 | 3222241220 |
oct | 1001107400 |
9 | 311103825 |
10 | 134516480 |
11 | 69a2724a |
12 | 39071228 |
13 | 21b3a467 |
14 | 13c18080 |
15 | bc21b05 |
hex | 8048f00 |
134516480 has 72 divisors (see below), whose sum is σ = 368263392. Its totient is φ = 46116864.
The previous prime is 134516479. The next prime is 134516521. The reversal of 134516480 is 84615431.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1454 + ... + 16466.
Almost surely, 2134516480 is an apocalyptic number.
134516480 is a gapful number since it is divisible by the number (10) 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 134516480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (184131696).
134516480 is an abundant number, since it is smaller than the sum of its proper divisors (233746912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134516480 is an equidigital number, since it uses as much as digits as its factorization.
134516480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15041 (or 15027 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 32.
The square root of 134516480 is about 11598.1239862316. The cubic root of 134516480 is about 512.3796013032.
The spelling of 134516480 in words is "one hundred thirty-four million, five hundred sixteen thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •