Base | Representation |
---|---|
bin | 111111011101101001… |
… | …0000000001010000101 |
3 | 111000210000020102000002 |
4 | 1332323102000022011 |
5 | 4213103211413210 |
6 | 142335310531045 |
7 | 12563203160411 |
oct | 1767322001205 |
9 | 430700212002 |
10 | 136286044805 |
11 | 52886a12689 |
12 | 224b5b06a85 |
13 | cb0c2c3481 |
14 | 684c297d41 |
15 | 3829b504a5 |
hex | 1fbb480285 |
136286044805 has 8 divisors (see below), whose sum is σ = 173163445272. Its totient is φ = 102615374848.
The previous prime is 136286044799. The next prime is 136286044831. The reversal of 136286044805 is 508440682631.
It can be written as a sum of positive squares in 4 ways, for example, as 10202818081 + 126083226724 = 101009^2 + 355082^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 136286044805 - 24 = 136286044789 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 136286044805.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 801682532 + ... + 801682701.
It is an arithmetic number, because the mean of its divisors is an integer number (21645430659).
Almost surely, 2136286044805 is an apocalyptic number.
It is an amenable number.
136286044805 is a deficient number, since it is larger than the sum of its proper divisors (36877400467).
136286044805 is a wasteful number, since it uses less digits than its factorization.
136286044805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1603365255.
The product of its (nonzero) digits is 1105920, while the sum is 47.
The spelling of 136286044805 in words is "one hundred thirty-six billion, two hundred eighty-six million, forty-four thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •