Base | Representation |
---|---|
bin | 110010000011001011110001… |
… | …001110011000101010101111 |
3 | 1001212101101002101121212210020 |
4 | 302003023301032120222233 |
5 | 212322431023434000421 |
6 | 2100054125203013223 |
7 | 64236140403010632 |
oct | 6203136116305257 |
9 | 1055341071555706 |
10 | 220121121000111 |
11 | 64156930293481 |
12 | 20830b4606a213 |
13 | 95a9442a81346 |
14 | 3c4dcc2031c19 |
15 | 1a6acc750ddc6 |
hex | c832f1398aaf |
220121121000111 has 128 divisors (see below), whose sum is σ = 311054558330880. Its totient is φ = 138324334003200.
The previous prime is 220121121000107. The next prime is 220121121000199. The reversal of 220121121000111 is 111000121121022.
It is a happy number.
220121121000111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 220121121000111 - 22 = 220121121000107 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220121221000111) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 56110403596 + ... + 56110407518.
It is an arithmetic number, because the mean of its divisors is an integer number (2430113736960).
Almost surely, 2220121121000111 is an apocalyptic number.
220121121000111 is a deficient number, since it is larger than the sum of its proper divisors (90933437330769).
220121121000111 is a wasteful number, since it uses less digits than its factorization.
220121121000111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4677.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 220121121000111 its reverse (111000121121022), we get a palindrome (331121242121133).
The spelling of 220121121000111 in words is "two hundred twenty trillion, one hundred twenty-one billion, one hundred twenty-one million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •