Base | Representation |
---|---|
bin | 111111101101000111… |
… | …1001110000111110101 |
3 | 111002010012111212002222 |
4 | 1333122033032013311 |
5 | 4220134141044034 |
6 | 142503022412125 |
7 | 12612110535464 |
oct | 1773217160765 |
9 | 432105455088 |
10 | 136805409269 |
11 | 530230a5911 |
12 | 2261ba31045 |
13 | cb92a98619 |
14 | 689b2509db |
15 | 385a54112e |
hex | 1fda3ce1f5 |
136805409269 has 8 divisors (see below), whose sum is σ = 139543864320. Its totient is φ = 134092911456.
The previous prime is 136805409263. The next prime is 136805409277. The reversal of 136805409269 is 962904508631.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-136805409269 is a prime.
It is a super-2 number, since 2×1368054092692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 136805409269.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136805409263) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6478664 + ... + 6499745.
It is an arithmetic number, because the mean of its divisors is an integer number (17442983040).
Almost surely, 2136805409269 is an apocalyptic number.
It is an amenable number.
136805409269 is a deficient number, since it is larger than the sum of its proper divisors (2738455051).
136805409269 is a wasteful number, since it uses less digits than its factorization.
136805409269 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12978619.
The product of its (nonzero) digits is 2799360, while the sum is 53.
The spelling of 136805409269 in words is "one hundred thirty-six billion, eight hundred five million, four hundred nine thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •