Base | Representation |
---|---|
bin | 1011000111010110110110… |
… | …1011100101111001101101 |
3 | 1121021022121001011011122221 |
4 | 2301311231223211321231 |
5 | 3100212123124213401 |
6 | 41554132100435341 |
7 | 2400640214614012 |
oct | 261655553457155 |
9 | 47238531134587 |
10 | 12221022101101 |
11 | 39919a7413780 |
12 | 14546236a8b51 |
13 | 6a858c091428 |
14 | 303701a07709 |
15 | 162d6bc0a7a1 |
hex | b1d6dae5e6d |
12221022101101 has 8 divisors (see below), whose sum is σ = 13334707209600. Its totient is φ = 11107784175840.
The previous prime is 12221022101083. The next prime is 12221022101111. The reversal of 12221022101101 is 10110122012221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12221022101101 - 217 = 12221021970029 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 (12221022101111) 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, 111738661 + ... + 111847978.
It is an arithmetic number, because the mean of its divisors is an integer number (1666838401200).
Almost surely, 212221022101101 is an apocalyptic number.
12221022101101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12221022101101 is a deficient number, since it is larger than the sum of its proper divisors (1113685108499).
12221022101101 is a wasteful number, since it uses less digits than its factorization.
12221022101101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223591619.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 12221022101101 its reverse (10110122012221), we get a palindrome (22331144113322).
The spelling of 12221022101101 in words is "twelve trillion, two hundred twenty-one billion, twenty-two million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •