Base | Representation |
---|---|
bin | 10000000110101… |
… | …01100110000000 |
3 | 100102012102012221 |
4 | 20003111212000 |
5 | 234040430413 |
6 | 21223300424 |
7 | 3230161000 |
oct | 1003254600 |
9 | 312172187 |
10 | 135092608 |
11 | 6a290092 |
12 | 392aa714 |
13 | 21cac771 |
14 | 13d28000 |
15 | bcd768d |
hex | 80d5980 |
135092608 has 128 divisors (see below), whose sum is σ = 334152000. Its totient is φ = 54190080.
The previous prime is 135092563. The next prime is 135092611. The reversal of 135092608 is 806290531.
135092608 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (34).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 746278 + ... + 746458.
Almost surely, 2135092608 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 135092608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167076000).
135092608 is an abundant number, since it is smaller than the sum of its proper divisors (199059392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135092608 is an equidigital number, since it uses as much as digits as its factorization.
135092608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233 (or 207 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 34.
The square root of 135092608 is about 11622.9345692041. The cubic root of 135092608 is about 513.1100590074.
The spelling of 135092608 in words is "one hundred thirty-five million, ninety-two thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •