Base | Representation |
---|---|
bin | 10000010000101… |
… | …11011010010010 |
3 | 100111200101101202 |
4 | 20020113122102 |
5 | 234410121040 |
6 | 21311431202 |
7 | 3244321016 |
oct | 1010273222 |
9 | 314611352 |
10 | 136410770 |
11 | 70000481 |
12 | 39825502 |
13 | 22351742 |
14 | 1418c546 |
15 | be98015 |
hex | 8217692 |
136410770 has 8 divisors (see below), whose sum is σ = 245539404. Its totient is φ = 54564304.
The previous prime is 136410767. The next prime is 136410787. The reversal of 136410770 is 77014631.
It can be written as a sum of positive squares in 2 ways, for example, as 130393561 + 6017209 = 11419^2 + 2453^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
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 3 ways as a sum of consecutive naturals, for example, 6820529 + ... + 6820548.
Almost surely, 2136410770 is an apocalyptic number.
136410770 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
136410770 is a deficient number, since it is larger than the sum of its proper divisors (109128634).
136410770 is a wasteful number, since it uses less digits than its factorization.
136410770 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13641084.
The product of its (nonzero) digits is 3528, while the sum is 29.
The square root of 136410770 is about 11679.5021297999. The cubic root of 136410770 is about 514.7735454569.
The spelling of 136410770 in words is "one hundred thirty-six million, four hundred ten thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •