Base | Representation |
---|---|
bin | 1010001011111011010000… |
… | …0001110000011100000101 |
3 | 1110122201011021010110010021 |
4 | 2202332310001300130011 |
5 | 2432000100011200401 |
6 | 35453113051455141 |
7 | 2234113305035221 |
oct | 242766401603405 |
9 | 43581137113107 |
10 | 11200000100101 |
11 | 362899108933a |
12 | 130a7754574b1 |
13 | 633203779957 |
14 | 2aa123681781 |
15 | 14650eb4d2a1 |
hex | a2fb4070705 |
11200000100101 has 16 divisors (see below), whose sum is σ = 12113704440640. Its totient is φ = 10320766606080.
The previous prime is 11200000100033. The next prime is 11200000100111. The reversal of 11200000100101 is 10100100000211.
It is a cyclic number.
It is not a de Polignac number, because 11200000100101 - 27 = 11200000099973 is a prime.
It is a super-4 number, since 4×112000001001014 (a number of 53 digits) contains 4444 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11200000100111) 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 15 ways as a sum of consecutive naturals, for example, 28244370 + ... + 28638163.
It is an arithmetic number, because the mean of its divisors is an integer number (757106527540).
Almost surely, 211200000100101 is an apocalyptic number.
It is an amenable number.
11200000100101 is a deficient number, since it is larger than the sum of its proper divisors (913704340539).
11200000100101 is a wasteful number, since it uses less digits than its factorization.
11200000100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56882836.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 11200000100101 its reverse (10100100000211), we get a palindrome (21300100100312).
The spelling of 11200000100101 in words is "eleven trillion, two hundred billion, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •