Base | Representation |
---|---|
bin | 1010000110101111101111… |
… | …0011100011001011010101 |
3 | 1110100012110101121002112110 |
4 | 2201223323303203023111 |
5 | 2424020322031201401 |
6 | 35344154425341233 |
7 | 2224513120615533 |
oct | 241537363431325 |
9 | 43305411532473 |
10 | 11111010022101 |
11 | 35a4175548630 |
12 | 12b547a937819 |
13 | 6279c0c59a72 |
14 | 2a5ac0955153 |
15 | 1440522b29d6 |
hex | a1afbce32d5 |
11111010022101 has 16 divisors (see below), whose sum is σ = 16181747039808. Its totient is φ = 6725496336000.
The previous prime is 11111010022051. The next prime is 11111010022103. The reversal of 11111010022101 is 10122001011111.
It is not a de Polignac number, because 11111010022101 - 241 = 8911986766549 is a prime.
It is a super-2 number, since 2×111110100221012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11111010022103) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 211201600 + ... + 211254201.
It is an arithmetic number, because the mean of its divisors is an integer number (1011359189988).
Almost surely, 211111010022101 is an apocalyptic number.
11111010022101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11111010022101 is a deficient number, since it is larger than the sum of its proper divisors (5070737017707).
11111010022101 is a wasteful number, since it uses less digits than its factorization.
11111010022101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 422456612.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11111010022101 its reverse (10122001011111), we get a palindrome (21233011033212).
The spelling of 11111010022101 in words is "eleven trillion, one hundred eleven billion, ten million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •