Base | Representation |
---|---|
bin | 1010001011111011100111… |
… | …1110110110000100000001 |
3 | 1110122201102020002220000120 |
4 | 2202332321332312010001 |
5 | 2432000301100000001 |
6 | 35453131021010453 |
7 | 2234115630132453 |
oct | 242767176660401 |
9 | 43581366086016 |
10 | 11200100000001 |
11 | 3628a32511640 |
12 | 130a7a29b3a29 |
13 | 63321b386a13 |
14 | 2aa132a482d3 |
15 | 1465187d3236 |
hex | a2fb9fb6101 |
11200100000001 has 16 divisors (see below), whose sum is σ = 16291110528000. Its totient is φ = 6787916067920.
The previous prime is 11200099999969. The next prime is 11200100000003. The reversal of 11200100000001 is 10000000100211.
It is a cyclic number.
It is not a de Polignac number, because 11200100000001 - 25 = 11200099999969 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11200100000003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18086500 + ... + 18695498.
It is an arithmetic number, because the mean of its divisors is an integer number (1018194408000).
Almost surely, 211200100000001 is an apocalyptic number.
11200100000001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11200100000001 is a deficient number, since it is larger than the sum of its proper divisors (5091010527999).
11200100000001 is a wasteful number, since it uses less digits than its factorization.
11200100000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1166316.
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 11200100000001 its reverse (10000000100211), we get a palindrome (21200100100212).
The spelling of 11200100000001 in words is "eleven trillion, two hundred billion, one hundred million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •