Base | Representation |
---|---|
bin | 1010001011111111000000… |
… | …1110101001001011110101 |
3 | 1110122210202122122022220112 |
4 | 2202333300032221023311 |
5 | 2432004132042024341 |
6 | 35453401211512405 |
7 | 2234150321013110 |
oct | 242776016511365 |
9 | 43583678568815 |
10 | 11201010111221 |
11 | 362935a21a677 |
12 | 130a9b7758705 |
13 | 633334ab0778 |
14 | 2aa1bb877577 |
15 | 14656d65aaeb |
hex | a2ff03a92f5 |
11201010111221 has 16 divisors (see below), whose sum is σ = 13496668300800. Its totient is φ = 9080863062768.
The previous prime is 11201010111199. The next prime is 11201010111241. The reversal of 11201010111221 is 12211101010211.
It is not a de Polignac number, because 11201010111221 - 26 = 11201010111157 is a prime.
It is a super-2 number, since 2×112010101112212 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11201010111196 and 11201010111205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11201010111241) 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, 67945235 + ... + 68109888.
It is an arithmetic number, because the mean of its divisors is an integer number (843541768800).
Almost surely, 211201010111221 is an apocalyptic number.
It is an amenable number.
11201010111221 is a deficient number, since it is larger than the sum of its proper divisors (2295658189579).
11201010111221 is a wasteful number, since it uses less digits than its factorization.
11201010111221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 136055768.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11201010111221 its reverse (12211101010211), we get a palindrome (23412111121432).
The spelling of 11201010111221 in words is "eleven trillion, two hundred one billion, ten million, one hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •