| Base | Representation |
|---|---|
| bin | 1010000110000111000110… |
| … | …0001100010011010111100 |
| 3 | 1110022011022001200010200100 |
| 4 | 2201201301201202122330 |
| 5 | 2423331001112010022 |
| 6 | 35335152100201100 |
| 7 | 2223645554112624 |
| oct | 241416141423274 |
| 9 | 43264261603610 |
| 10 | 11100100110012 |
| 11 | 359a587151161 |
| 12 | 12b3335099190 |
| 13 | 6269728b5394 |
| 14 | 2a5367a15884 |
| 15 | 143b145bb1ac |
| hex | a18718626bc |
11100100110012 has 72 divisors (see below), whose sum is σ = 28831841126816. Its totient is φ = 3598169226624.
The previous prime is 11100100109951. The next prime is 11100100110013. The reversal of 11100100110012 is 21001100100111.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 11100100109976 and 11100100110003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100100110013) 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 23 ways as a sum of consecutive naturals, for example, 419193 + ... + 4730319.
Almost surely, 211100100110012 is an apocalyptic number.
11100100110012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11100100110012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14415920563408).
11100100110012 is an abundant number, since it is smaller than the sum of its proper divisors (17731741016804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11100100110012 is a wasteful number, since it uses less digits than its factorization.
11100100110012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4313107 (or 4313102 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11100100110012 its reverse (21001100100111), we get a palindrome (32101200210123).
Subtracting 11100100110012 from its reverse (21001100100111), we obtain a palindrome (9900999990099).
The spelling of 11100100110012 in words is "eleven trillion, one hundred billion, one hundred million, one hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •