Base | Representation |
---|---|
bin | 1010001011111011010000… |
… | …0001110000011010100001 |
3 | 1110122201011021010102222120 |
4 | 2202332310001300122201 |
5 | 2432000100011200001 |
6 | 35453113051454453 |
7 | 2234113305035016 |
oct | 242766401603241 |
9 | 43581137112876 |
10 | 11200000100001 |
11 | 3628991089259 |
12 | 130a775457429 |
13 | 6332037798ab |
14 | 2aa12368170d |
15 | 14650eb4d236 |
hex | a2fb40706a1 |
11200000100001 has 8 divisors (see below), whose sum is σ = 15582608834880. Its totient is φ = 7142029049232.
The previous prime is 11200000099991. The next prime is 11200000100021. The reversal of 11200000100001 is 10000100000211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11200000100001 - 25 = 11200000099969 is a prime.
11200000100001 is a modest number, since divided by 100001 gives 1120 as remainder.
It is not an unprimeable number, because it can be changed into a prime (11200000100021) 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 7 ways as a sum of consecutive naturals, for example, 81159420946 + ... + 81159421083.
It is an arithmetic number, because the mean of its divisors is an integer number (1947826104360).
Almost surely, 211200000100001 is an apocalyptic number.
It is an amenable number.
11200000100001 is a deficient number, since it is larger than the sum of its proper divisors (4382608734879).
11200000100001 is a wasteful number, since it uses less digits than its factorization.
11200000100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162318842055.
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 11200000100001 its reverse (10000100000211), we get a palindrome (21200100100212).
The spelling of 11200000100001 in words is "eleven trillion, two hundred billion, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.898 sec. • engine limits •