Base | Representation |
---|---|
bin | 10000001010110… |
… | …01101010101000 |
3 | 100110012220021210 |
4 | 20011121222220 |
5 | 234210233301 |
6 | 21243033120 |
7 | 3234603111 |
oct | 1005315250 |
9 | 313186253 |
10 | 135633576 |
11 | 6a61a571 |
12 | 3950b7a0 |
13 | 2213ba70 |
14 | 14029208 |
15 | bd92ad6 |
hex | 8159aa8 |
135633576 has 128 divisors (see below), whose sum is σ = 391184640. Its totient is φ = 38860800.
The previous prime is 135633529. The next prime is 135633577. The reversal of 135633576 is 675336531.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is not an unprimeable number, because it can be changed into a prime (135633577) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 293986 + ... + 294446.
It is an arithmetic number, because the mean of its divisors is an integer number (3056130).
Almost surely, 2135633576 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 135633576, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (195592320).
135633576 is an abundant number, since it is smaller than the sum of its proper divisors (255551064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135633576 is a wasteful number, since it uses less digits than its factorization.
135633576 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 547 (or 543 counting only the distinct ones).
The product of its digits is 170100, while the sum is 39.
The square root of 135633576 is about 11646.1828939786. The cubic root of 135633576 is about 513.7940501298.
The spelling of 135633576 in words is "one hundred thirty-five million, six hundred thirty-three thousand, five hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •