Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100010001111111001101111 |
3 | 222020212222120211100122110100 |
4 | 231201131001202033321233 |
5 | 202220224112000000421 |
6 | 1545451355203442143 |
7 | 60112524135604632 |
oct | 5541350142177157 |
9 | 866788524318410 |
10 | 200211000000111 |
11 | 58880010012431 |
12 | 1a556296986353 |
13 | 8793a7c505759 |
14 | 376239a9b5c19 |
15 | 1822e330a2c26 |
hex | b6174188fe6f |
200211000000111 has 12 divisors (see below), whose sum is σ = 289380363695800. Its totient is φ = 133387832140560.
The previous prime is 200211000000047. The next prime is 200211000000131. The reversal of 200211000000111 is 111000000112002.
It is a happy number.
It is not a de Polignac number, because 200211000000111 - 26 = 200211000000047 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200211000000093 and 200211000000102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200211000000131) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7180640245 + ... + 7180668126.
Almost surely, 2200211000000111 is an apocalyptic number.
200211000000111 is a deficient number, since it is larger than the sum of its proper divisors (89169363695689).
200211000000111 is a wasteful number, since it uses less digits than its factorization.
200211000000111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14361309926 (or 14361309923 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 200211000000111 its reverse (111000000112002), we get a palindrome (311211000112113).
The spelling of 200211000000111 in words is "two hundred trillion, two hundred eleven billion, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •