Base | Representation |
---|---|
bin | 11101010011100100111100… |
… | …101001011010100000011101 |
3 | 121220100122020111012121111202 |
4 | 131103210330221122200131 |
5 | 113343203014403400401 |
6 | 1134042351450525245 |
7 | 36101620626540416 |
oct | 3523447451324035 |
9 | 556318214177452 |
10 | 128888691075101 |
11 | 38082428a99611 |
12 | 125575a9a36825 |
13 | 56bc1c787b399 |
14 | 23b8362baa80d |
15 | ed7a55d8506b |
hex | 75393ca5a81d |
128888691075101 has 8 divisors (see below), whose sum is σ = 129537160972800. Its totient is φ = 128240229058128.
The previous prime is 128888691075059. The next prime is 128888691075113. The reversal of 128888691075101 is 101570196888821.
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 128888691075101 - 214 = 128888691058717 is a prime.
It is a super-2 number, since 2×1288886910751012 (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 (128888691075161) 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, 32319380 + ... + 36087666.
It is an arithmetic number, because the mean of its divisors is an integer number (16192145121600).
Almost surely, 2128888691075101 is an apocalyptic number.
It is an amenable number.
128888691075101 is a deficient number, since it is larger than the sum of its proper divisors (648469897699).
128888691075101 is a wasteful number, since it uses less digits than its factorization.
128888691075101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3940363.
The product of its (nonzero) digits is 15482880, while the sum is 65.
The spelling of 128888691075101 in words is "one hundred twenty-eight trillion, eight hundred eighty-eight billion, six hundred ninety-one million, seventy-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •