Base | Representation |
---|---|
bin | 111111101010001000… |
… | …0110011010000011101 |
3 | 111001212012212200021021 |
4 | 1333110100303100131 |
5 | 4214433010111341 |
6 | 142445042004141 |
7 | 12606452455300 |
oct | 1772420632035 |
9 | 431765780237 |
10 | 136705160221 |
11 | 52a81554263 |
12 | 225b2346651 |
13 | cb78098666 |
14 | 688bbd6b37 |
15 | 385183c9d1 |
hex | 1fd443341d |
136705160221 has 12 divisors (see below), whose sum is σ = 168378745788. Its totient is φ = 110283153792.
The previous prime is 136705160213. The next prime is 136705160233. The reversal of 136705160221 is 122061507631.
It can be written as a sum of positive squares in 2 ways, for example, as 120052548196 + 16652612025 = 346486^2 + 129045^2 .
It is not a de Polignac number, because 136705160221 - 23 = 136705160213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136705190221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 82055086 + ... + 82056751.
It is an arithmetic number, because the mean of its divisors is an integer number (14031562149).
Almost surely, 2136705160221 is an apocalyptic number.
It is an amenable number.
136705160221 is a deficient number, since it is larger than the sum of its proper divisors (31673585567).
136705160221 is a wasteful number, since it uses less digits than its factorization.
136705160221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164111868 (or 164111861 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 34.
Adding to 136705160221 its reverse (122061507631), we get a palindrome (258766667852).
The spelling of 136705160221 in words is "one hundred thirty-six billion, seven hundred five million, one hundred sixty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •