Base | Representation |
---|---|
bin | 11110111100010001110011… |
… | …000000001000101001110100 |
3 | 122211211110202011110220121221 |
4 | 132330101303000020221310 |
5 | 120314043330321043443 |
6 | 1201231550524320124 |
7 | 40443502165651600 |
oct | 3674216300105164 |
9 | 584743664426557 |
10 | 136083673221748 |
11 | 3a3a684192660a |
12 | 13319b169a3044 |
13 | 5ac1834a55c85 |
14 | 25866b08d6500 |
15 | 10aecae226eed |
hex | 7bc473008a74 |
136083673221748 has 36 divisors (see below), whose sum is σ = 277090483132260. Its totient is φ = 58308309921792.
The previous prime is 136083673221721. The next prime is 136083673221763. The reversal of 136083673221748 is 847122376380631.
It can be written as a sum of positive squares in 2 ways, for example, as 21869951547024 + 114213721674724 = 4676532^2 + 10687082^2 .
It is a super-2 number, since 2×1360836732217482 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 78090253 + ... + 79813876.
It is an arithmetic number, because the mean of its divisors is an integer number (7696957864785).
Almost surely, 2136083673221748 is an apocalyptic number.
It is an amenable number.
136083673221748 is an abundant number, since it is smaller than the sum of its proper divisors (141006809910512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136083673221748 is a wasteful number, since it uses less digits than its factorization.
136083673221748 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157908544 (or 157908535 counting only the distinct ones).
The product of its (nonzero) digits is 48771072, while the sum is 61.
The spelling of 136083673221748 in words is "one hundred thirty-six trillion, eighty-three billion, six hundred seventy-three million, two hundred twenty-one thousand, seven hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •