Base | Representation |
---|---|
bin | 10000010010111… |
… | …10011110101000 |
3 | 100112020011201000 |
4 | 20021132132220 |
5 | 234443424424 |
6 | 21321555000 |
7 | 3246642465 |
oct | 1011363650 |
9 | 315204630 |
10 | 136701864 |
11 | 7018a152 |
12 | 39945a60 |
13 | 224240a0 |
14 | 1422666c |
15 | c0043c9 |
hex | 825e7a8 |
136701864 has 128 divisors (see below), whose sum is σ = 414288000. Its totient is φ = 41513472.
The previous prime is 136701839. The next prime is 136701869. The reversal of 136701864 is 468107631.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (136701869) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 249639 + ... + 250185.
It is an arithmetic number, because the mean of its divisors is an integer number (3236625).
Almost surely, 2136701864 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 136701864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (207144000).
136701864 is an abundant number, since it is smaller than the sum of its proper divisors (277586136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136701864 is a wasteful number, since it uses less digits than its factorization.
136701864 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 664 (or 654 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The square root of 136701864 is about 11691.9572356385. The cubic root of 136701864 is about 515.1394526052.
The spelling of 136701864 in words is "one hundred thirty-six million, seven hundred one thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •