Base | Representation |
---|---|
bin | 1000000010110010110… |
… | …0110011100101000001 |
3 | 111012200121210021220122 |
4 | 2000230230303211001 |
5 | 4231002324142302 |
6 | 143252203350025 |
7 | 12661310145254 |
oct | 2005454634501 |
9 | 435617707818 |
10 | 138188896577 |
11 | 53673036356 |
12 | 22947222315 |
13 | 100535b5074 |
14 | 698cca509b |
15 | 38dbc233a2 |
hex | 202cb33941 |
138188896577 has 8 divisors (see below), whose sum is σ = 140945261760. Its totient is φ = 135455032720.
The previous prime is 138188896553. The next prime is 138188896589. The reversal of 138188896577 is 775698881831.
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 138188896577 - 26 = 138188896513 is a prime.
It is a super-2 number, since 2×1381888965772 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (71).
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 138188896577.
It is not an unprimeable number, because it can be changed into a prime (138188896507) 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, 5612927 + ... + 5637492.
It is an arithmetic number, because the mean of its divisors is an integer number (17618157720).
Almost surely, 2138188896577 is an apocalyptic number.
It is an amenable number.
138188896577 is a deficient number, since it is larger than the sum of its proper divisors (2756365183).
138188896577 is a wasteful number, since it uses less digits than its factorization.
138188896577 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11250663.
The product of its digits is 162570240, while the sum is 71.
The spelling of 138188896577 in words is "one hundred thirty-eight billion, one hundred eighty-eight million, eight hundred ninety-six thousand, five hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •