Base | Representation |
---|---|
bin | 1011101001110110000… |
… | …0101111010110110110 |
3 | 201010210001111201210001 |
4 | 2322131200233112312 |
5 | 11240013020213420 |
6 | 231550430421514 |
7 | 20315263165066 |
oct | 2723540572666 |
9 | 633701451701 |
10 | 200211101110 |
11 | 779aaa46629 |
12 | 3297636189a |
13 | 15b58c92287 |
14 | 99941533a6 |
15 | 531bc72b0a |
hex | 2e9d82f5b6 |
200211101110 has 8 divisors (see below), whose sum is σ = 360379982016. Its totient is φ = 80084440440.
The previous prime is 200211101107. The next prime is 200211101113. The reversal of 200211101110 is 11101112002.
It is an interprime number because it is at equal distance from previous prime (200211101107) and next prime (200211101113).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 20021110111 = 200211101110 / (2 + 0 + 0 + 2 + 1 + 1 + 1 + 0 + 1 + 1 + 1 + 0).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200211101113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10010555046 + ... + 10010555065.
It is an arithmetic number, because the mean of its divisors is an integer number (45047497752).
Almost surely, 2200211101110 is an apocalyptic number.
200211101110 is a deficient number, since it is larger than the sum of its proper divisors (160168880906).
200211101110 is a wasteful number, since it uses less digits than its factorization.
200211101110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20021110118.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 200211101110 its reverse (11101112002), we get a palindrome (211312213112).
The spelling of 200211101110 in words is "two hundred billion, two hundred eleven million, one hundred one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •