Base | Representation |
---|---|
bin | 110010000011001011110000… |
… | …000010100011001001100101 |
3 | 1001212101101001000012212112120 |
4 | 302003023300002203021211 |
5 | 212322431003341320401 |
6 | 2100054123212540153 |
7 | 64236140042021466 |
oct | 6203136002431145 |
9 | 1055341030185476 |
10 | 220121101120101 |
11 | 64156920045315 |
12 | 20830b3b481659 |
13 | 95a943b91071c |
14 | 3c4dcbd538d6d |
15 | 1a6acc58d3836 |
hex | c832f00a3265 |
220121101120101 has 32 divisors (see below), whose sum is σ = 295304216887296. Its totient is φ = 145844166744000.
The previous prime is 220121101120043. The next prime is 220121101120103. The reversal of 220121101120101 is 101021101121022.
It is a happy number.
It is not a de Polignac number, because 220121101120101 - 217 = 220121100989029 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220121101120103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3430943515 + ... + 3431007671.
It is an arithmetic number, because the mean of its divisors is an integer number (9228256777728).
Almost surely, 2220121101120101 is an apocalyptic number.
It is an amenable number.
220121101120101 is a deficient number, since it is larger than the sum of its proper divisors (75183115767195).
220121101120101 is a wasteful number, since it uses less digits than its factorization.
220121101120101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69793.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 220121101120101 its reverse (101021101121022), we get a palindrome (321142202241123).
The spelling of 220121101120101 in words is "two hundred twenty trillion, one hundred twenty-one billion, one hundred one million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •