Base | Representation |
---|---|
bin | 1010000111010001010000… |
… | …1111110100110011010101 |
3 | 1110101001200121200110112210 |
4 | 2201310110033310303111 |
5 | 2424142240031201401 |
6 | 35352243450504033 |
7 | 2225252133426561 |
oct | 241642417646325 |
9 | 43331617613483 |
10 | 11120010022101 |
11 | 35a7a73839862 |
12 | 12b7170a35019 |
13 | 6287c670a056 |
14 | 2a62d5d6a6a1 |
15 | 1443cc48e4d6 |
hex | a1d143f4cd5 |
11120010022101 has 8 divisors (see below), whose sum is σ = 14880205951264. Its totient is φ = 7386577053840.
The previous prime is 11120010022073. The next prime is 11120010022169. The reversal of 11120010022101 is 10122001002111.
11120010022101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11120010022101 - 213 = 11120010013909 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120010022181) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6690739255 + ... + 6690740916.
It is an arithmetic number, because the mean of its divisors is an integer number (1860025743908).
Almost surely, 211120010022101 is an apocalyptic number.
It is an amenable number.
11120010022101 is a deficient number, since it is larger than the sum of its proper divisors (3760195929163).
11120010022101 is a wasteful number, since it uses less digits than its factorization.
11120010022101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13381480451.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11120010022101 its reverse (10122001002111), we get a palindrome (21242011024212).
The spelling of 11120010022101 in words is "eleven trillion, one hundred twenty billion, ten million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •