Base | Representation |
---|---|
bin | 10000001110011… |
… | …10000000000000 |
3 | 100111010002221002 |
4 | 20013032000000 |
5 | 234321010310 |
6 | 21301151132 |
7 | 3241626251 |
oct | 1007160000 |
9 | 314102832 |
10 | 136110080 |
11 | 6a915577 |
12 | 396bb4a8 |
13 | 22277912 |
14 | 14110b28 |
15 | be38da5 |
hex | 81ce000 |
136110080 has 56 divisors (see below), whose sum is σ = 326742552. Its totient is φ = 54427648.
The previous prime is 136110061. The next prime is 136110089. The reversal of 136110080 is 80011631.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136110089) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39299 + ... + 42621.
Almost surely, 2136110080 is an apocalyptic number.
136110080 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 136110080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (163371276).
136110080 is an abundant number, since it is smaller than the sum of its proper divisors (190632472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136110080 is an frugal number, since it uses more digits than its factorization.
136110080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3354 (or 3330 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 20.
The square root of 136110080 is about 11666.6224761068. The cubic root of 136110080 is about 514.3950290849.
The spelling of 136110080 in words is "one hundred thirty-six million, one hundred ten thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •