Base | Representation |
---|---|
bin | 10000001010010… |
… | …11101110110100 |
3 | 100110002222222212 |
4 | 20011023232310 |
5 | 234201422000 |
6 | 21241512552 |
7 | 3234244523 |
oct | 1005135664 |
9 | 313088885 |
10 | 135576500 |
11 | 6a5906a4 |
12 | 394a2758 |
13 | 2211baa7 |
14 | 140124ba |
15 | bd80c35 |
hex | 814bbb4 |
135576500 has 48 divisors (see below), whose sum is σ = 297513216. Its totient is φ = 53972000.
The previous prime is 135576499. The next prime is 135576541. The reversal of 135576500 is 5675531.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 130985 + ... + 132015.
It is an arithmetic number, because the mean of its divisors is an integer number (6198192).
Almost surely, 2135576500 is an apocalyptic number.
135576500 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 135576500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (148756608).
135576500 is an abundant number, since it is smaller than the sum of its proper divisors (161936716).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135576500 is a wasteful number, since it uses less digits than its factorization.
135576500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1313 (or 1301 counting only the distinct ones).
The product of its (nonzero) digits is 15750, while the sum is 32.
The square root of 135576500 is about 11643.7322195248. The cubic root of 135576500 is about 513.7219700827.
The spelling of 135576500 in words is "one hundred thirty-five million, five hundred seventy-six thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.159 sec. • engine limits •