Base | Representation |
---|---|
bin | 1010000110000110101110… |
… | …1000010000111101101101 |
3 | 1110022011001011120111200010 |
4 | 2201201223220100331231 |
5 | 2423330300302211341 |
6 | 35335134204323433 |
7 | 2223643243352220 |
oct | 241415350207555 |
9 | 43264034514603 |
10 | 11100001210221 |
11 | 359a5363412a0 |
12 | 12b3307b43579 |
13 | 6269582685b1 |
14 | 2a535882d5b7 |
15 | 143b0aa82716 |
hex | a186ba10f6d |
11100001210221 has 16 divisors (see below), whose sum is σ = 18451950064128. Its totient is φ = 5766234394800.
The previous prime is 11100001210217. The next prime is 11100001210231. The reversal of 11100001210221 is 12201210000111.
It is not a de Polignac number, because 11100001210221 - 22 = 11100001210217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11100001210197 and 11100001210206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100001210201) 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, 24025976415 + ... + 24025976876.
It is an arithmetic number, because the mean of its divisors is an integer number (1153246879008).
Almost surely, 211100001210221 is an apocalyptic number.
11100001210221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11100001210221 is a deficient number, since it is larger than the sum of its proper divisors (7351948853907).
11100001210221 is a wasteful number, since it uses less digits than its factorization.
11100001210221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48051953312.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11100001210221 its reverse (12201210000111), we get a palindrome (23301211210332).
The spelling of 11100001210221 in words is "eleven trillion, one hundred billion, one million, two hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •