Base | Representation |
---|---|
bin | 101101011110101101000111… |
… | …011110000010110010101111 |
3 | 222020012221001112012021222211 |
4 | 231132231013132002302233 |
5 | 202204130300434000421 |
6 | 1545224521023151251 |
7 | 60063056423601304 |
oct | 5536550736026257 |
9 | 866187045167884 |
10 | 200022121000111 |
11 | 588079a5814123 |
12 | 1a525763745527 |
13 | 877c00b1c8067 |
14 | 375719d8a10ab |
15 | 181d07b11e9e1 |
hex | b5eb47782caf |
200022121000111 has 32 divisors (see below), whose sum is σ = 208992442982400. Its totient is φ = 191312251764480.
The previous prime is 200022121000087. The next prime is 200022121000171. The reversal of 200022121000111 is 111000121220002.
It is a cyclic number.
It is not a de Polignac number, because 200022121000111 - 219 = 200022120475823 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200022121000091 and 200022121000100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200022121000171) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 128889121 + ... + 130431781.
It is an arithmetic number, because the mean of its divisors is an integer number (6531013843200).
Almost surely, 2200022121000111 is an apocalyptic number.
200022121000111 is a deficient number, since it is larger than the sum of its proper divisors (8970321982289).
200022121000111 is a wasteful number, since it uses less digits than its factorization.
200022121000111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1543159.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200022121000111 its reverse (111000121220002), we get a palindrome (311022242220113).
The spelling of 200022121000111 in words is "two hundred trillion, twenty-two 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.079 sec. • engine limits •