Base | Representation |
---|---|
bin | 10000001110011… |
… | …00010000000000 |
3 | 100111002202002121 |
4 | 20013030100000 |
5 | 234320243122 |
6 | 21301054024 |
7 | 3241566331 |
oct | 1007142000 |
9 | 314082077 |
10 | 136102912 |
11 | 6a910150 |
12 | 396b7314 |
13 | 2227458a |
14 | 1410c288 |
15 | be36bc7 |
hex | 81cc400 |
136102912 has 88 divisors (see below), whose sum is σ = 304790112. Its totient is φ = 60211200.
The previous prime is 136102873. The next prime is 136102913. The reversal of 136102912 is 219201631.
It is a tau number, because it is divible by the number of its divisors (88).
It is not an unprimeable number, because it can be changed into a prime (136102913) 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 7 ways as a sum of consecutive naturals, for example, 484212 + ... + 484492.
It is an arithmetic number, because the mean of its divisors is an integer number (3463524).
Almost surely, 2136102912 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 136102912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152395056).
136102912 is an abundant number, since it is smaller than the sum of its proper divisors (168687200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136102912 is a wasteful number, since it uses less digits than its factorization.
136102912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 355 (or 337 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 25.
The square root of 136102912 is about 11666.3152708985. The cubic root of 136102912 is about 514.3859990207.
The spelling of 136102912 in words is "one hundred thirty-six million, one hundred two thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •