Base | Representation |
---|---|
bin | 1010000000010110010101… |
… | …0100110100000100000000 |
3 | 1102221200210100120111010222 |
4 | 2200011211110310010000 |
5 | 2420220233431400000 |
6 | 35221501332242212 |
7 | 2213542535214425 |
oct | 240054524640400 |
9 | 42850710514128 |
10 | 11001111200000 |
11 | 35615aa523a19 |
12 | 1298109a70368 |
13 | 61a5286c684c |
14 | 2a0656d8bd4c |
15 | 14126e003a85 |
hex | a0165534100 |
11001111200000 has 108 divisors (see below), whose sum is σ = 27447306892740. Its totient is φ = 4400444160000.
The previous prime is 11001111199987. The next prime is 11001111200039. The reversal of 11001111200000 is 211110011.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 8115570278656 + 2885540921344 = 2848784^2 + 1698688^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 6075695 + ... + 7675694.
Almost surely, 211001111200000 is an apocalyptic number.
11001111200000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11001111200000 is an abundant number, since it is smaller than the sum of its proper divisors (16446195692740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11001111200000 is an frugal number, since it uses more digits than its factorization.
11001111200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13751430 (or 13751396 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 11001111200000 its reverse (211110011), we get a palindrome (11001322310011).
The spelling of 11001111200000 in words is "eleven trillion, one billion, one hundred eleven million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •