Base | Representation |
---|---|
bin | 11110111100101000000101… |
… | …100101001111110100010101 |
3 | 122211220202112011121001102022 |
4 | 132330220011211033310111 |
5 | 120314441334424313222 |
6 | 1201250545510022525 |
7 | 40445310250636211 |
oct | 3674500545176425 |
9 | 584822464531368 |
10 | 136107607260437 |
11 | 3a405a03a8707a |
12 | 13322696347a45 |
13 | 5ac3b7a498b47 |
14 | 2587901481941 |
15 | 10b0710539042 |
hex | 7bca0594fd15 |
136107607260437 has 8 divisors (see below), whose sum is σ = 136239643383360. Its totient is φ = 135975614846400.
The previous prime is 136107607260421. The next prime is 136107607260439. The reversal of 136107607260437 is 734062706701631.
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 136107607260437 - 24 = 136107607260421 is a prime.
It is a super-2 number, since 2×1361076072604372 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136107607260439) 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, 4694564 + ... + 17153837.
It is an arithmetic number, because the mean of its divisors is an integer number (17029955422920).
Almost surely, 2136107607260437 is an apocalyptic number.
It is an amenable number.
136107607260437 is a deficient number, since it is larger than the sum of its proper divisors (132036122923).
136107607260437 is a wasteful number, since it uses less digits than its factorization.
136107607260437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21854443.
The product of its (nonzero) digits is 5334336, while the sum is 53.
The spelling of 136107607260437 in words is "one hundred thirty-six trillion, one hundred seven billion, six hundred seven million, two hundred sixty thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •