Base | Representation |
---|---|
bin | 1010001100100001010000… |
… | …0011011110111101010000 |
3 | 1110200200111012002221102111 |
4 | 2203020110003132331100 |
5 | 2432131442440200422 |
6 | 35501521214355104 |
7 | 2234624143101100 |
oct | 243102403367520 |
9 | 43620435087374 |
10 | 11210201100112 |
11 | 36322462a9663 |
12 | 13107417bba94 |
13 | 63416acb1631 |
14 | 2aa8103a7200 |
15 | 14690a4b1a77 |
hex | a32140def50 |
11210201100112 has 60 divisors (see below), whose sum is σ = 25742562873876. Its totient is φ = 4713723356160.
The previous prime is 11210201100103. The next prime is 11210201100157. The reversal of 11210201100112 is 21100110201211.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 7620934444816 + 3589266655296 = 2760604^2 + 1894536^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11210201100092 and 11210201100101.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 134852089 + ... + 134935192.
Almost surely, 211210201100112 is an apocalyptic number.
It is an amenable number.
11210201100112 is an abundant number, since it is smaller than the sum of its proper divisors (14532361773764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11210201100112 is a wasteful number, since it uses less digits than its factorization.
11210201100112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269787356 (or 269787343 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11210201100112 its reverse (21100110201211), we get a palindrome (32310311301323).
The spelling of 11210201100112 in words is "eleven trillion, two hundred ten billion, two hundred one million, one hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •