Base | Representation |
---|---|
bin | 10000010010011… |
… | …01101010000000 |
3 | 100112002200012000 |
4 | 20021031222000 |
5 | 234434223320 |
6 | 21320304000 |
7 | 3246234552 |
oct | 1011155200 |
9 | 315080160 |
10 | 136632960 |
11 | 70142402 |
12 | 39912000 |
13 | 223cb909 |
14 | 142094d2 |
15 | beddc90 |
hex | 824da80 |
136632960 has 128 divisors (see below), whose sum is σ = 483969600. Its totient is φ = 36430848.
The previous prime is 136632959. The next prime is 136632983. The reversal of 136632960 is 69236631.
136632960 is a `hidden beast` number, since 1 + 366 + 3 + 296 + 0 = 666.
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 (36).
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, 13327 + ... + 21233.
Almost surely, 2136632960 is an apocalyptic number.
136632960 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 136632960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (241984800).
136632960 is an abundant number, since it is smaller than the sum of its proper divisors (347336640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136632960 is an equidigital number, since it uses as much as digits as its factorization.
136632960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7935 (or 7917 counting only the distinct ones).
The product of its (nonzero) digits is 34992, while the sum is 36.
The square root of 136632960 is about 11689.0102232824. The cubic root of 136632960 is about 515.0528867672.
The spelling of 136632960 in words is "one hundred thirty-six million, six hundred thirty-two thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •