Base | Representation |
---|---|
bin | 101101100000000001000001… |
… | …110011010000011110011101 |
3 | 222020112112121200202110000021 |
4 | 231200001001303100132131 |
5 | 202212114311333223401 |
6 | 1545334141310032141 |
7 | 60102426236342602 |
oct | 5540010163203635 |
9 | 866475550673007 |
10 | 200112220211101 |
11 | 58842130437970 |
12 | 1a53b1097a8651 |
13 | 8787669745963 |
14 | 375b6a9a266a9 |
15 | 18205a10472a1 |
hex | b60041cd079d |
200112220211101 has 8 divisors (see below), whose sum is σ = 220465668352608. Its totient is φ = 180119010090000.
The previous prime is 200112220211089. The next prime is 200112220211143. The reversal of 200112220211101 is 101112022211002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200112220211101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200112220211161) 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, 90059503935 + ... + 90059506156.
It is an arithmetic number, because the mean of its divisors is an integer number (27558208544076).
Almost surely, 2200112220211101 is an apocalyptic number.
It is an amenable number.
200112220211101 is a deficient number, since it is larger than the sum of its proper divisors (20353448141507).
200112220211101 is a wasteful number, since it uses less digits than its factorization.
200112220211101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 180119010203.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 200112220211101 its reverse (101112022211002), we get a palindrome (301224242422103).
The spelling of 200112220211101 in words is "two hundred trillion, one hundred twelve billion, two hundred twenty million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •