Base | Representation |
---|---|
bin | 10000001110100… |
… | …10000101111111 |
3 | 100111010221221002 |
4 | 20013102011333 |
5 | 234322024342 |
6 | 21301400515 |
7 | 3242026163 |
oct | 1007220577 |
9 | 314127832 |
10 | 136126847 |
11 | 6a92712a |
12 | 3970913b |
13 | 2228243c |
14 | 14116ca3 |
15 | be3dd32 |
hex | 81d217f |
136126847 has 8 divisors (see below), whose sum is σ = 140389200. Its totient is φ = 131909440.
The previous prime is 136126831. The next prime is 136126853. The reversal of 136126847 is 748621631.
136126847 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 136126847 - 24 = 136126831 is a prime.
It is a super-2 number, since 2×1361268472 = 37061036948322818, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 136126847.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136116847) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5033 + ... + 17250.
It is an arithmetic number, because the mean of its divisors is an integer number (17548650).
Almost surely, 2136126847 is an apocalyptic number.
136126847 is a deficient number, since it is larger than the sum of its proper divisors (4262353).
136126847 is a wasteful number, since it uses less digits than its factorization.
136126847 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22473.
The product of its digits is 48384, while the sum is 38.
The square root of 136126847 is about 11667.3410424141. The cubic root of 136126847 is about 514.4161504874.
The spelling of 136126847 in words is "one hundred thirty-six million, one hundred twenty-six thousand, eight hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •