Base | Representation |
---|---|
bin | 1001100110001000000101… |
… | …10101111100101111101001 |
3 | 2202201020221102222102121001 |
4 | 10303010002311330233221 |
5 | 10231210300314201441 |
6 | 112513433443515001 |
7 | 4305340644535063 |
oct | 463040265745751 |
9 | 82636842872531 |
10 | 21101222022121 |
11 | 67a5a837a636a |
12 | 2449684688a61 |
13 | ba0ab52c4107 |
14 | 52d439b48733 |
15 | 268d57c72731 |
hex | 133102d7cbe9 |
21101222022121 has 8 divisors (see below), whose sum is σ = 21106950105600. Its totient is φ = 21095494296240.
The previous prime is 21101222022109. The next prime is 21101222022161. The reversal of 21101222022121 is 12122022210112.
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 21101222022121 - 239 = 20551466208233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21101222022161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 152221240 + ... + 152359798.
It is an arithmetic number, because the mean of its divisors is an integer number (2638368763200).
Almost surely, 221101222022121 is an apocalyptic number.
It is an amenable number.
21101222022121 is a deficient number, since it is larger than the sum of its proper divisors (5728083479).
21101222022121 is a wasteful number, since it uses less digits than its factorization.
21101222022121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178799.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 21101222022121 its reverse (12122022210112), we get a palindrome (33223244232233).
The spelling of 21101222022121 in words is "twenty-one trillion, one hundred one billion, two hundred twenty-two million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •