Base | Representation |
---|---|
bin | 11001010010001011010000… |
… | …011111011101010111001101 |
3 | 112120201122011012211222010011 |
4 | 121102023100133131113031 |
5 | 104033401003001413401 |
6 | 1032300400040513221 |
7 | 32264643435431665 |
oct | 3122132037352715 |
9 | 476648135758104 |
10 | 111200201201101 |
11 | 3248281665a691 |
12 | 1057b41647b811 |
13 | 4a0819847406c |
14 | 1d661930811a5 |
15 | ccc88bde3451 |
hex | 6522d07dd5cd |
111200201201101 has 24 divisors (see below), whose sum is σ = 123097320967680. Its totient is φ = 100319469104736.
The previous prime is 111200201201093. The next prime is 111200201201123. The reversal of 111200201201101 is 101102102002111.
It is a happy number.
It is not a de Polignac number, because 111200201201101 - 23 = 111200201201093 is a prime.
It is a super-2 number, since 2×1112002012011012 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111200201201191) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 87938581 + ... + 89194138.
It is an arithmetic number, because the mean of its divisors is an integer number (5129055040320).
Almost surely, 2111200201201101 is an apocalyptic number.
It is an amenable number.
111200201201101 is a deficient number, since it is larger than the sum of its proper divisors (11897119766579).
111200201201101 is a wasteful number, since it uses less digits than its factorization.
111200201201101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177132841 (or 177132822 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 111200201201101 its reverse (101102102002111), we get a palindrome (212302303203212).
The spelling of 111200201201101 in words is "one hundred eleven trillion, two hundred billion, two hundred one million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •