Base | Representation |
---|---|
bin | 10000000001100101010… |
… | …011000001001010011000 |
3 | 10220021102021222122012000 |
4 | 100001211103001022120 |
5 | 121020240021041323 |
6 | 2201520035521000 |
7 | 142363016003403 |
oct | 20014523011230 |
9 | 3807367878160 |
10 | 1101211112088 |
11 | 395025a6747a |
12 | 159509459160 |
13 | 7cac7990549 |
14 | 3b42828ad3a |
15 | 1d9a1e83e43 |
hex | 100654c1298 |
1101211112088 has 32 divisors (see below), whose sum is σ = 3058919756400. Its totient is φ = 367070370624.
The previous prime is 1101211112087. The next prime is 1101211112137. The reversal of 1101211112088 is 8802111121011.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101211112081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2549099581 + ... + 2549100012.
Almost surely, 21101211112088 is an apocalyptic number.
1101211112088 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1101211112088 is an abundant number, since it is smaller than the sum of its proper divisors (1957708644312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101211112088 is a wasteful number, since it uses less digits than its factorization.
1101211112088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5098199608 (or 5098199598 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 27.
Adding to 1101211112088 its reverse (8802111121011), we get a palindrome (9903322233099).
The spelling of 1101211112088 in words is "one trillion, one hundred one billion, two hundred eleven million, one hundred twelve thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •