Base | Representation |
---|---|
bin | 10000000110010… |
… | …10111100000000 |
3 | 100102010012100100 |
4 | 20003022330000 |
5 | 234033031320 |
6 | 21222322400 |
7 | 3226616514 |
oct | 1003127400 |
9 | 312105310 |
10 | 135048960 |
11 | 6a260312 |
12 | 39289400 |
13 | 21c95937 |
14 | 13d16144 |
15 | bcc9790 |
hex | 80caf00 |
135048960 has 216 divisors, whose sum is σ = 492644880. Its totient is φ = 34062336.
The previous prime is 135048959. The next prime is 135048967. The reversal of 135048960 is 69840531.
135048960 is a `hidden beast` number, since 13 + 504 + 89 + 60 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135048967) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 218572 + ... + 219188.
Almost surely, 2135048960 is an apocalyptic number.
135048960 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 135048960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (246322440).
135048960 is an abundant number, since it is smaller than the sum of its proper divisors (357595920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135048960 is a wasteful number, since it uses less digits than its factorization.
135048960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 663 (or 646 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The square root of 135048960 is about 11621.0567505714. The cubic root of 135048960 is about 513.0547916352.
The spelling of 135048960 in words is "one hundred thirty-five million, forty-eight thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •