Base | Representation |
---|---|
bin | 10000000011010… |
… | …10001100000000 |
3 | 100101101001202000 |
4 | 20001222030000 |
5 | 233432341142 |
6 | 21210024000 |
7 | 3223346250 |
oct | 1001521400 |
9 | 311331660 |
10 | 134652672 |
11 | 6a00a600 |
12 | 39118000 |
13 | 21b8744b |
14 | 13c51960 |
15 | bc4c14c |
hex | 806a300 |
134652672 has 432 divisors, whose sum is σ = 521955840. Its totient is φ = 33454080.
The previous prime is 134652629. The next prime is 134652689. The reversal of 134652672 is 276256431.
It is a tau number, because it is divible by the number of its divisors (432).
It is a Harshad number since it is a multiple of its sum of digits (36).
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 47 ways as a sum of consecutive naturals, for example, 5854453 + ... + 5854475.
Almost surely, 2134652672 is an apocalyptic number.
134652672 is a gapful number since it is divisible by the number (12) 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 134652672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (260977920).
134652672 is an abundant number, since it is smaller than the sum of its proper divisors (387303168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134652672 is a wasteful number, since it uses less digits than its factorization.
134652672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77 (or 46 counting only the distinct ones).
The product of its digits is 60480, while the sum is 36.
The square root of 134652672 is about 11603.9937952414. The cubic root of 134652672 is about 512.5524635565.
The spelling of 134652672 in words is "one hundred thirty-four million, six hundred fifty-two thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •