Base | Representation |
---|---|
bin | 111111110001011100… |
… | …0111101111001101101 |
3 | 111002111022122211000202 |
4 | 1333202320331321231 |
5 | 4220433321224410 |
6 | 142525250003245 |
7 | 12615522433412 |
oct | 1774270757155 |
9 | 432438584022 |
10 | 136950570605 |
11 | 53098032762 |
12 | 22660576525 |
13 | cbb6b91cc4 |
14 | 68b263a109 |
15 | 3868166ca5 |
hex | 1fe2e3de6d |
136950570605 has 8 divisors (see below), whose sum is σ = 171485932032. Its totient is φ = 104796958288.
The previous prime is 136950570587. The next prime is 136950570629. The reversal of 136950570605 is 506075059631.
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-136950570605 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 136950570605.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 595437149 + ... + 595437378.
It is an arithmetic number, because the mean of its divisors is an integer number (21435741504).
Almost surely, 2136950570605 is an apocalyptic number.
It is an amenable number.
136950570605 is a deficient number, since it is larger than the sum of its proper divisors (34535361427).
136950570605 is a wasteful number, since it uses less digits than its factorization.
136950570605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1190874555.
The product of its (nonzero) digits is 850500, while the sum is 47.
The spelling of 136950570605 in words is "one hundred thirty-six billion, nine hundred fifty million, five hundred seventy thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •