Base | Representation |
---|---|
bin | 11101001000100000000100… |
… | …110100110110001011000111 |
3 | 121210122212120221012212011022 |
4 | 131020200010310312023013 |
5 | 113243220203101232034 |
6 | 1132300552020101355 |
7 | 35662624005524441 |
oct | 3510400464661307 |
9 | 553585527185138 |
10 | 128127545336519 |
11 | 37909650078573 |
12 | 12453b8783485b |
13 | 56654b64aaa51 |
14 | 238d598ba9491 |
15 | ec2d58babb2e |
hex | 748804d362c7 |
128127545336519 has 4 divisors (see below), whose sum is σ = 128192288918760. Its totient is φ = 128062801754280.
The previous prime is 128127545336513. The next prime is 128127545336521. The reversal of 128127545336519 is 915633545721821.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-128127545336519 is a prime.
It is a super-2 number, since 2×1281275453365192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (128127545336513) 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, 32371788152 + ... + 32371792109.
It is an arithmetic number, because the mean of its divisors is an integer number (32048072229690).
Almost surely, 2128127545336519 is an apocalyptic number.
128127545336519 is a deficient number, since it is larger than the sum of its proper divisors (64743582241).
128127545336519 is an equidigital number, since it uses as much as digits as its factorization.
128127545336519 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64743582240.
The product of its digits is 54432000, while the sum is 62.
The spelling of 128127545336519 in words is "one hundred twenty-eight trillion, one hundred twenty-seven billion, five hundred forty-five million, three hundred thirty-six thousand, five hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •