Base | Representation |
---|---|
bin | 1010001011111011010010… |
… | …1111100010011001010001 |
3 | 1110122201012002201011112110 |
4 | 2202332310233202121101 |
5 | 2432000111044214301 |
6 | 35453114201015533 |
7 | 2234113512040650 |
oct | 242766457423121 |
9 | 43581162634473 |
10 | 11200012101201 |
11 | 3628997935a00 |
12 | 130a7794845a9 |
13 | 6332060bc2b1 |
14 | 2aa1250c7197 |
15 | 146510c1e0d6 |
hex | a2fb4be2651 |
11200012101201 has 48 divisors (see below), whose sum is σ = 18906960084992. Its totient is φ = 5772375433440.
The previous prime is 11200012101163. The next prime is 11200012101203. The reversal of 11200012101201 is 10210121000211.
It is not a de Polignac number, because 11200012101201 - 219 = 11200011576913 is a prime.
It is a super-4 number, since 4×112000121012014 (a number of 53 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (11200012101203) 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 47 ways as a sum of consecutive naturals, for example, 17030515 + ... + 17675928.
Almost surely, 211200012101201 is an apocalyptic number.
11200012101201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11200012101201 is a deficient number, since it is larger than the sum of its proper divisors (7706947983791).
11200012101201 is a wasteful number, since it uses less digits than its factorization.
11200012101201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34706602 (or 34706591 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11200012101201 its reverse (10210121000211), we get a palindrome (21410133101412).
The spelling of 11200012101201 in words is "eleven trillion, two hundred billion, twelve million, one hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •