Base | Representation |
---|---|
bin | 1011101001011101111… |
… | …1011111100101111101 |
3 | 201010112000110220112100 |
4 | 2322113133133211331 |
5 | 11234311142023401 |
6 | 231532422055313 |
7 | 20312625610425 |
oct | 2722737374575 |
9 | 633460426470 |
10 | 200110111101 |
11 | 77958a3930a |
12 | 3294857a539 |
13 | 15b41092c84 |
14 | 9984985485 |
15 | 5312e74b86 |
hex | 2e977df97d |
200110111101 has 6 divisors (see below), whose sum is σ = 289047938270. Its totient is φ = 133406740728.
The previous prime is 200110111081. The next prime is 200110111151. The reversal of 200110111101 is 101111011002.
It can be written as a sum of positive squares in only one way, i.e., 193344884100 + 6765227001 = 439710^2 + 82251^2 .
It is not a de Polignac number, because 200110111101 - 26 = 200110111037 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 22234456789 = 200110111101 / (2 + 0 + 0 + 1 + 1 + 0 + 1 + 1 + 1 + 1 + 0 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200110111151) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 11117228386 + ... + 11117228403.
Almost surely, 2200110111101 is an apocalyptic number.
It is an amenable number.
200110111101 is a deficient number, since it is larger than the sum of its proper divisors (88937827169).
200110111101 is a wasteful number, since it uses less digits than its factorization.
200110111101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22234456795 (or 22234456792 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 200110111101 its reverse (101111011002), we get a palindrome (301221122103).
The spelling of 200110111101 in words is "two hundred billion, one hundred ten million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •