Base | Representation |
---|---|
bin | 11110111110000001111111… |
… | …100101000011100011011001 |
3 | 122212020222200221012112102211 |
4 | 132332001333211003203121 |
5 | 120323032041141423230 |
6 | 1201403153012355121 |
7 | 40455265433554024 |
oct | 3676017745034331 |
9 | 585228627175384 |
10 | 136204143311065 |
11 | 3a4429420787a5 |
12 | 13339338015aa1 |
13 | 5acccc3451cab |
14 | 258c45c44a1bb |
15 | 10b2eb05d842a |
hex | 7be07f9438d9 |
136204143311065 has 32 divisors (see below), whose sum is σ = 173667375976320. Its totient is φ = 102256515777024.
The previous prime is 136204143311059. The next prime is 136204143311069. The reversal of 136204143311065 is 560113341402631.
It is a cyclic number.
It is not a de Polignac number, because 136204143311065 - 227 = 136204009093337 is a prime.
It is a super-3 number, since 3×1362041433110653 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (136204143311069) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 147511669 + ... + 148432141.
It is an arithmetic number, because the mean of its divisors is an integer number (5427105499260).
Almost surely, 2136204143311065 is an apocalyptic number.
It is an amenable number.
136204143311065 is a deficient number, since it is larger than the sum of its proper divisors (37463232665255).
136204143311065 is a wasteful number, since it uses less digits than its factorization.
136204143311065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 935161.
The product of its (nonzero) digits is 155520, while the sum is 40.
Adding to 136204143311065 its reverse (560113341402631), we get a palindrome (696317484713696).
The spelling of 136204143311065 in words is "one hundred thirty-six trillion, two hundred four billion, one hundred forty-three million, three hundred eleven thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.375 sec. • engine limits •