Base | Representation |
---|---|
bin | 1010000110110000000111… |
… | …0101001011000101010110 |
3 | 1110100012201102210221102200 |
4 | 2201230001311023011112 |
5 | 2424021023421022443 |
6 | 35344212440145330 |
7 | 2224515456064413 |
oct | 241540165130526 |
9 | 43305642727380 |
10 | 11111111110998 |
11 | 35a4217613178 |
12 | 12b54a8768246 |
13 | 627a08b92092 |
14 | 2a5ad014b10a |
15 | 14405b0cedd3 |
hex | a1b01d4b156 |
11111111110998 has 24 divisors (see below), whose sum is σ = 24150017537568. Its totient is φ = 3692020093872.
The previous prime is 11111111110997. The next prime is 11111111111017. The reversal of 11111111110998 is 89901111111111.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11111111110993) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 973628286 + ... + 973639697.
It is an arithmetic number, because the mean of its divisors is an integer number (1006250730732).
Almost surely, 211111111110998 is an apocalyptic number.
11111111110998 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
11111111110998 is an abundant number, since it is smaller than the sum of its proper divisors (13038906426570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11111111110998 is a wasteful number, since it uses less digits than its factorization.
11111111110998 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1947268308 (or 1947268305 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 36.
The spelling of 11111111110998 in words is "eleven trillion, one hundred eleven billion, one hundred eleven million, one hundred ten thousand, nine hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •