Base | Representation |
---|---|
bin | 11110111011000110000111… |
… | …111011110000010110011101 |
3 | 122211112201000111020102021022 |
4 | 132323012013323300112131 |
5 | 120311230424011012131 |
6 | 1201130352122213525 |
7 | 40434564516054521 |
oct | 3673060773602635 |
9 | 584481014212238 |
10 | 136002420016541 |
11 | 3a375336583951 |
12 | 1330621b3542a5 |
13 | 5ab6c860bb720 |
14 | 25827a353bd81 |
15 | 10acb05c0d37b |
hex | 7bb187ef059d |
136002420016541 has 4 divisors (see below), whose sum is σ = 146464144633212. Its totient is φ = 125540695399872.
The previous prime is 136002420016537. The next prime is 136002420016613. The reversal of 136002420016541 is 145610024200631.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 27025961822500 + 108976458194041 = 5198650^2 + 10439179^2 .
It is a cyclic number.
It is not a de Polignac number, because 136002420016541 - 22 = 136002420016537 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136002420016531) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5230862308316 + ... + 5230862308341.
It is an arithmetic number, because the mean of its divisors is an integer number (36616036158303).
Almost surely, 2136002420016541 is an apocalyptic number.
It is an amenable number.
136002420016541 is a deficient number, since it is larger than the sum of its proper divisors (10461724616671).
136002420016541 is a wasteful number, since it uses less digits than its factorization.
136002420016541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10461724616670.
The product of its (nonzero) digits is 34560, while the sum is 35.
The spelling of 136002420016541 in words is "one hundred thirty-six trillion, two billion, four hundred twenty million, sixteen thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •