Base | Representation |
---|---|
bin | 1011101001110110000… |
… | …0010110111010110011 |
3 | 201010210001022122110200 |
4 | 2322131200112322303 |
5 | 11240013004013021 |
6 | 231550424330243 |
7 | 20315262300210 |
oct | 2723540267263 |
9 | 633701278420 |
10 | 200211001011 |
11 | 779aa9883aa |
12 | 32976313983 |
13 | 15b58c58848 |
14 | 9994128b07 |
15 | 531bc53126 |
hex | 2e9d816eb3 |
200211001011 has 24 divisors (see below), whose sum is σ = 330520968960. Its totient is φ = 114401468016.
The previous prime is 200211000989. The next prime is 200211001031. The reversal of 200211001011 is 110100112002.
It is a happy number.
It is not a de Polignac number, because 200211001011 - 26 = 200211000947 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 200211000984 and 200211001002.
It is not an unprimeable number, because it can be changed into a prime (200211001031) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1892626 + ... + 1995608.
It is an arithmetic number, because the mean of its divisors is an integer number (13771707040).
Almost surely, 2200211001011 is an apocalyptic number.
200211001011 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
200211001011 is a deficient number, since it is larger than the sum of its proper divisors (130309967949).
200211001011 is a wasteful number, since it uses less digits than its factorization.
200211001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133855 (or 133852 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 200211001011 its reverse (110100112002), we get a palindrome (310311113013).
The spelling of 200211001011 in words is "two hundred billion, two hundred eleven million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.888 sec. • engine limits •