Base | Representation |
---|---|
bin | 101101100000000000111011… |
… | …111001001011101100110111 |
3 | 222020112112100210021010122220 |
4 | 231200000323321023230313 |
5 | 202212114111000213421 |
6 | 1545334123405453423 |
7 | 60102423624045312 |
oct | 5540007371135467 |
9 | 866475323233586 |
10 | 200112121101111 |
11 | 5884208a4a408a |
12 | 1a53b0a0571273 |
13 | 87876520542ab |
14 | 375b69a7c7979 |
15 | 18205974bb3c6 |
hex | b6003be4bb37 |
200112121101111 has 8 divisors (see below), whose sum is σ = 266821518238464. Its totient is φ = 133405402348920.
The previous prime is 200112121101059. The next prime is 200112121101133. The reversal of 200112121101111 is 111101121211002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-200112121101111 is a prime.
It is a super-2 number, since 2×2001121211011112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200112121121111) 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, 669421951 + ... + 669720816.
It is an arithmetic number, because the mean of its divisors is an integer number (33352689779808).
Almost surely, 2200112121101111 is an apocalyptic number.
200112121101111 is a deficient number, since it is larger than the sum of its proper divisors (66709397137353).
200112121101111 is a wasteful number, since it uses less digits than its factorization.
200112121101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1339192581.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 200112121101111 its reverse (111101121211002), we get a palindrome (311213242312113).
The spelling of 200112121101111 in words is "two hundred trillion, one hundred twelve billion, one hundred twenty-one million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •