Base | Representation |
---|---|
bin | 10000001101111… |
… | …11101100101100 |
3 | 100111000010120110 |
4 | 20012333230230 |
5 | 234312122000 |
6 | 21300020020 |
7 | 3241263414 |
oct | 1006775454 |
9 | 314003513 |
10 | 136051500 |
11 | 6a885562 |
12 | 39691610 |
13 | 22257060 |
14 | 140d7644 |
15 | be26850 |
hex | 81bfb2c |
136051500 has 96 divisors (see below), whose sum is σ = 426718656. Its totient is φ = 33484800.
The previous prime is 136051483. The next prime is 136051501. The reversal of 136051500 is 5150631.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (136051501) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16012 + ... + 22988.
It is an arithmetic number, because the mean of its divisors is an integer number (4444986).
Almost surely, 2136051500 is an apocalyptic number.
136051500 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 136051500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (213359328).
136051500 is an abundant number, since it is smaller than the sum of its proper divisors (290667156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136051500 is a wasteful number, since it uses less digits than its factorization.
136051500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7012 (or 7000 counting only the distinct ones).
The product of its (nonzero) digits is 450, while the sum is 21.
The square root of 136051500 is about 11664.1116249803. Note that the first 3 decimals coincide. The cubic root of 136051500 is about 514.3212221956.
The spelling of 136051500 in words is "one hundred thirty-six million, fifty-one thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •