Base | Representation |
---|---|
bin | 1010000110000111000110… |
… | …0001011111111110100000 |
3 | 1110022011022001122121221112 |
4 | 2201201301201133332200 |
5 | 2423331001111200000 |
6 | 35335152100042452 |
7 | 2223645554041502 |
oct | 241416141377640 |
9 | 43264261577845 |
10 | 11100100100000 |
11 | 359a58714468a |
12 | 12b3335093428 |
13 | 6269728b0962 |
14 | 2a5367a11d72 |
15 | 143b145b8235 |
hex | a187185ffa0 |
11100100100000 has 72 divisors (see below), whose sum is σ = 27314904570156. Its totient is φ = 4440040000000.
The previous prime is 11100100099993. The next prime is 11100100100009. The reversal of 11100100100000 is 100100111.
It can be written as a sum of positive squares in 6 ways, for example, as 2873689478416 + 8226410621584 = 1695196^2 + 2868172^2 .
It is a Harshad number since it is a multiple of its sum of digits (5).
It is not an unprimeable number, because it can be changed into a prime (11100100100009) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 55400501 + ... + 55600500.
Almost surely, 211100100100000 is an apocalyptic number.
11100100100000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11100100100000 is an abundant number, since it is smaller than the sum of its proper divisors (16214804470156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11100100100000 is an frugal number, since it uses more digits than its factorization.
11100100100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111001036 (or 111001008 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 11100100100000 its reverse (100100111), we get a palindrome (11100200200111).
The spelling of 11100100100000 in words is "eleven trillion, one hundred billion, one hundred million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •