Base | Representation |
---|---|
bin | 1010001101001010001110… |
… | …1101100101001011001110 |
3 | 1110201201212210202112021222 |
4 | 2203102203231211023032 |
5 | 2432322010002241420 |
6 | 35510540525123342 |
7 | 2235463553361341 |
oct | 243224355451316 |
9 | 43651783675258 |
10 | 11221201212110 |
11 | 363698060360a |
12 | 13128b16b9552 |
13 | 635201c47c46 |
14 | 2ab1752a6458 |
15 | 146d51074225 |
hex | a34a3b652ce |
11221201212110 has 24 divisors (see below), whose sum is σ = 21114524937240. Its totient is φ = 4293329157392.
The previous prime is 11221201212079. The next prime is 11221201212113. The reversal of 11221201212110 is 1121210212211.
11221201212110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11221201212113) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1060599740 + ... + 1060610319.
It is an arithmetic number, because the mean of its divisors is an integer number (879771872385).
Almost surely, 211221201212110 is an apocalyptic number.
11221201212110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11221201212110 is a deficient number, since it is larger than the sum of its proper divisors (9893323725130).
11221201212110 is a wasteful number, since it uses less digits than its factorization.
11221201212110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2121210112 (or 2121210089 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11221201212110 its reverse (1121210212211), we get a palindrome (12342411424321).
The spelling of 11221201212110 in words is "eleven trillion, two hundred twenty-one billion, two hundred one million, two hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •