Base | Representation |
---|---|
bin | 111011111101111010… |
… | …1000111101101111111 |
3 | 110022101211111222010111 |
4 | 1313323311013231333 |
5 | 4102214414324142 |
6 | 135054342050451 |
7 | 12206156634553 |
oct | 1677365075577 |
9 | 408354458114 |
10 | 128779058047 |
11 | 4a68446a3a2 |
12 | 20b5ba19a27 |
13 | c1b3c5a283 |
14 | 6339287863 |
15 | 353aa8ce17 |
hex | 1dfbd47b7f |
128779058047 has 4 divisors (see below), whose sum is σ = 128816270136. Its totient is φ = 128741845960.
The previous prime is 128779057999. The next prime is 128779058081. The reversal of 128779058047 is 740850977821.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 740850977821 = 191 ⋅3878800931.
It is a cyclic number.
It is not a de Polignac number, because 128779058047 - 227 = 128644840319 is a prime.
It is a super-3 number, since 3×1287790580473 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 128779057982 and 128779058000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (128779058147) 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, 18600853 + ... + 18607774.
It is an arithmetic number, because the mean of its divisors is an integer number (32204067534).
Almost surely, 2128779058047 is an apocalyptic number.
128779058047 is a deficient number, since it is larger than the sum of its proper divisors (37212089).
128779058047 is an equidigital number, since it uses as much as digits as its factorization.
128779058047 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37212088.
The product of its (nonzero) digits is 7902720, while the sum is 58.
The spelling of 128779058047 in words is "one hundred twenty-eight billion, seven hundred seventy-nine million, fifty-eight thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •