Base | Representation |
---|---|
bin | 10000001011001… |
… | …01001010100000 |
3 | 100110022021220002 |
4 | 20011211022200 |
5 | 234213240142 |
6 | 21244035132 |
7 | 3235160321 |
oct | 1005451240 |
9 | 313267802 |
10 | 135680672 |
11 | 6a651996 |
12 | 39532aa8 |
13 | 2215732a |
14 | 1403c448 |
15 | bda1a32 |
hex | 81652a0 |
135680672 has 48 divisors (see below), whose sum is σ = 297743040. Its totient is φ = 60484608.
The previous prime is 135680669. The next prime is 135680759. The reversal of 135680672 is 276086531.
It is a super-3 number, since 3×1356806723 (a number of 25 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (38).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3773 + ... + 16899.
It is an arithmetic number, because the mean of its divisors is an integer number (6202980).
Almost surely, 2135680672 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 135680672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (148871520).
135680672 is an abundant number, since it is smaller than the sum of its proper divisors (162062368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135680672 is a wasteful number, since it uses less digits than its factorization.
135680672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13173 (or 13165 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 38.
The square root of 135680672 is about 11648.2046685315. The cubic root of 135680672 is about 513.8535114252.
It can be divided in two parts, 1356 and 80672, that added together give a palindrome (82028).
The spelling of 135680672 in words is "one hundred thirty-five million, six hundred eighty thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •