Base | Representation |
---|---|
bin | 11111000001001111001001… |
… | …111001001101011100011001 |
3 | 122220001001022022221120222222 |
4 | 133001033021321031130121 |
5 | 120340134214430044122 |
6 | 1202052304114353425 |
7 | 40510224432014324 |
oct | 3701171171153431 |
9 | 586031268846888 |
10 | 136424433440537 |
11 | 3a518306110540 |
12 | 13373b7688b875 |
13 | 5b179cc29bc28 |
14 | 2598d991777bb |
15 | 10b8aa4ed7b42 |
hex | 7c13c9e4d719 |
136424433440537 has 8 divisors (see below), whose sum is σ = 148888229641632. Its totient is φ = 123970899736000.
The previous prime is 136424433440509. The next prime is 136424433440579. The reversal of 136424433440537 is 735044334424631.
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-136424433440537 is a prime.
It is a super-2 number, since 2×1364244334405372 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (136424433740537) 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, 2565596339 + ... + 2565649512.
It is an arithmetic number, because the mean of its divisors is an integer number (18611028705204).
Almost surely, 2136424433440537 is an apocalyptic number.
It is an amenable number.
136424433440537 is a deficient number, since it is larger than the sum of its proper divisors (12463796201095).
136424433440537 is a wasteful number, since it uses less digits than its factorization.
136424433440537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5131248279.
The product of its (nonzero) digits is 34836480, while the sum is 53.
The spelling of 136424433440537 in words is "one hundred thirty-six trillion, four hundred twenty-four billion, four hundred thirty-three million, four hundred forty thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •