Base | Representation |
---|---|
bin | 1010110100000001100011… |
… | …1111111011111000111001 |
3 | 1120002120022002220211112000 |
4 | 2231000120333323320321 |
5 | 3024241421023421024 |
6 | 41141402525211213 |
7 | 2334641515111035 |
oct | 255003077737071 |
9 | 46076262824460 |
10 | 11888888888889 |
11 | 387405a920551 |
12 | 1400190a00b09 |
13 | 68316ac517ac |
14 | 2d15d50071c5 |
15 | 1593cd4e9cc9 |
hex | ad018ffbe39 |
11888888888889 has 32 divisors (see below), whose sum is σ = 18043152449280. Its totient is φ = 7732441699200.
The previous prime is 11888888888887. The next prime is 11888888888897. The reversal of 11888888888889 is 98888888888811.
It is not a de Polignac number, because 11888888888889 - 21 = 11888888888887 is a prime.
It is a plaindrome in base 10.
It is a self number, because there is not a number n which added to its sum of digits gives 11888888888889.
It is not an unprimeable number, because it can be changed into a prime (11888888888887) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 68892099 + ... + 69064455.
It is an arithmetic number, because the mean of its divisors is an integer number (563848514040).
Almost surely, 211888888888889 is an apocalyptic number.
It is an amenable number.
11888888888889 is a deficient number, since it is larger than the sum of its proper divisors (6154263560391).
11888888888889 is a wasteful number, since it uses less digits than its factorization.
11888888888889 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234718 (or 234712 counting only the distinct ones).
The product of its digits is 77309411328, while the sum is 99.
It can be divided in two parts, 11 and 888888888889, that multiplied together give a palindrome (9777777777779).
The spelling of 11888888888889 in words is "eleven trillion, eight hundred eighty-eight billion, eight hundred eighty-eight million, eight hundred eighty-eight thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •