Base | Representation |
---|---|
bin | 110010010001101111000101… |
… | …010101010100110111011011 |
3 | 1001222220222020111010011012022 |
4 | 302101233011111110313123 |
5 | 212440322014133031021 |
6 | 2102141345252405055 |
7 | 64401321201202304 |
oct | 6221570525246733 |
9 | 1058828214104168 |
10 | 221121112002011 |
11 | 64501a34122a21 |
12 | 2097290501678b |
13 | 964c829219360 |
14 | 3c864671b57ab |
15 | 1a86d030991ab |
hex | c91bc5554ddb |
221121112002011 has 8 divisors (see below), whose sum is σ = 238198641027984. Its totient is φ = 204053327650080.
The previous prime is 221121112001981. The next prime is 221121112002017. The reversal of 221121112002011 is 110200211121122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 221121112002011 - 218 = 221121111739867 is a prime.
It is a super-2 number, since 2×2211211120020112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (221121112002017) 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, 2436121376 + ... + 2436212141.
It is an arithmetic number, because the mean of its divisors is an integer number (29774830128498).
Almost surely, 2221121112002011 is an apocalyptic number.
221121112002011 is a deficient number, since it is larger than the sum of its proper divisors (17077529025973).
221121112002011 is a wasteful number, since it uses less digits than its factorization.
221121112002011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4872337021.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 221121112002011 its reverse (110200211121122), we get a palindrome (331321323123133).
The spelling of 221121112002011 in words is "two hundred twenty-one trillion, one hundred twenty-one billion, one hundred twelve million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •