Base | Representation |
---|---|
bin | 10000010001010… |
… | …11011000010110 |
3 | 100111211112121020 |
4 | 20020223120112 |
5 | 234420230231 |
6 | 21313302010 |
7 | 3245111340 |
oct | 1010533026 |
9 | 314745536 |
10 | 136492566 |
11 | 70056981 |
12 | 39864906 |
13 | 2237ca42 |
14 | 141b0290 |
15 | beb2396 |
hex | 822b616 |
136492566 has 64 divisors (see below), whose sum is σ = 326369280. Its totient is φ = 37234080.
The previous prime is 136492549. The next prime is 136492583. The reversal of 136492566 is 665294631.
It is an interprime number because it is at equal distance from previous prime (136492549) and next prime (136492583).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 102195 + ... + 103521.
It is an arithmetic number, because the mean of its divisors is an integer number (5099520).
Almost surely, 2136492566 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 136492566, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (163184640).
136492566 is an abundant number, since it is smaller than the sum of its proper divisors (189876714).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136492566 is a wasteful number, since it uses less digits than its factorization.
136492566 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1449.
The product of its digits is 233280, while the sum is 42.
The square root of 136492566 is about 11683.0032953860. The cubic root of 136492566 is about 514.8764161311.
The spelling of 136492566 in words is "one hundred thirty-six million, four hundred ninety-two thousand, five hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •