Base | Representation |
---|---|
bin | 10000001110000… |
… | …11101110110001 |
3 | 100111000222020012 |
4 | 20013003232301 |
5 | 234313134032 |
6 | 21300224305 |
7 | 3241362521 |
oct | 1007035661 |
9 | 314028205 |
10 | 136068017 |
11 | 6a896a08 |
12 | 3969b095 |
13 | 22261727 |
14 | 140dd681 |
15 | be2b6b2 |
hex | 81c3bb1 |
136068017 has 8 divisors (see below), whose sum is σ = 144871272. Its totient is φ = 127353600.
The previous prime is 136067969. The next prime is 136068043. The reversal of 136068017 is 710860631.
It can be written as a sum of positive squares in 4 ways, for example, as 36048016 + 100020001 = 6004^2 + 10001^2 .
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 136068017 - 222 = 131873713 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (136068067) 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 7 ways as a sum of consecutive naturals, for example, 19034 + ... + 25187.
It is an arithmetic number, because the mean of its divisors is an integer number (18108909).
Almost surely, 2136068017 is an apocalyptic number.
136068017 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
136068017 is a deficient number, since it is larger than the sum of its proper divisors (8803255).
136068017 is a wasteful number, since it uses less digits than its factorization.
136068017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44419.
The product of its (nonzero) digits is 6048, while the sum is 32.
The square root of 136068017 is about 11664.8196299814. The cubic root of 136068017 is about 514.3420346573.
The spelling of 136068017 in words is "one hundred thirty-six million, sixty-eight thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •