Base | Representation |
---|---|
bin | 10000001110010… |
… | …11000110001010 |
3 | 100111002111121120 |
4 | 20013023012022 |
5 | 234320120221 |
6 | 21301020110 |
7 | 3241546500 |
oct | 1007130612 |
9 | 314074546 |
10 | 136098186 |
11 | 6a907644 |
12 | 396b4636 |
13 | 22272393 |
14 | 1410a670 |
15 | be355c6 |
hex | 81cb18a |
136098186 has 48 divisors (see below), whose sum is σ = 317649600. Its totient is φ = 38760960.
The previous prime is 136098181. The next prime is 136098203. The reversal of 136098186 is 681890631.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (136098181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 131491 + ... + 132521.
It is an arithmetic number, because the mean of its divisors is an integer number (6617700).
Almost surely, 2136098186 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 136098186, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (158824800).
136098186 is an abundant number, since it is smaller than the sum of its proper divisors (181551414).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136098186 is a wasteful number, since it uses less digits than its factorization.
136098186 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1499 (or 1492 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 42.
The square root of 136098186 is about 11666.1127201823. The cubic root of 136098186 is about 514.3800451526.
The spelling of 136098186 in words is "one hundred thirty-six million, ninety-eight thousand, one hundred eighty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •