Base | Representation |
---|---|
bin | 1011000000111101010111… |
… | …0100011110100101110101 |
3 | 1120212210212101112112001120 |
4 | 2300033111310132211311 |
5 | 3041412013112024341 |
6 | 41431432415014153 |
7 | 2356666231251216 |
oct | 260172564364565 |
9 | 46783771475046 |
10 | 12111100111221 |
11 | 394a31a305841 |
12 | 1437266b0a359 |
13 | 69b0c1aa8c77 |
14 | 2dc274d2d40d |
15 | 1600868c2066 |
hex | b03d5d1e975 |
12111100111221 has 64 divisors (see below), whose sum is σ = 16929511449600. Its totient is φ = 7694304224256.
The previous prime is 12111100111213. The next prime is 12111100111261. The reversal of 12111100111221 is 12211100111121.
It is not a de Polignac number, because 12111100111221 - 23 = 12111100111213 is a prime.
It is a super-2 number, since 2×121111001112212 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12111100111221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12111100111211) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 556233091 + ... + 556254863.
It is an arithmetic number, because the mean of its divisors is an integer number (264523616400).
Almost surely, 212111100111221 is an apocalyptic number.
It is an amenable number.
12111100111221 is a deficient number, since it is larger than the sum of its proper divisors (4818411338379).
12111100111221 is a wasteful number, since it uses less digits than its factorization.
12111100111221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22398.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 12111100111221 its reverse (12211100111121), we get a palindrome (24322200222342).
The spelling of 12111100111221 in words is "twelve trillion, one hundred eleven billion, one hundred million, one hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •