Base | Representation |
---|---|
bin | 1011101001000110011… |
… | …0001011100111110011 |
3 | 201010021010100202101200 |
4 | 2322101212023213303 |
5 | 11234110331413021 |
6 | 231514530102243 |
7 | 20310315105006 |
oct | 2722146134763 |
9 | 633233322350 |
10 | 200011201011 |
11 | 77908121736 |
12 | 3291b41a983 |
13 | 15b267415ab |
14 | 997579953d |
15 | 5309438126 |
hex | 2e9198b9f3 |
200011201011 has 12 divisors (see below), whose sum is σ = 289234503792. Its totient is φ = 133188753456.
The previous prime is 200011201003. The next prime is 200011201067. The reversal of 200011201011 is 110102110002.
It is a happy number.
It is not a de Polignac number, because 200011201011 - 23 = 200011201003 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 = 200011200984 and 200011201002.
It is not an unprimeable number, because it can be changed into a prime (200011201001) 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, 12662271 + ... + 12678056.
It is an arithmetic number, because the mean of its divisors is an integer number (24102875316).
Almost surely, 2200011201011 is an apocalyptic number.
200011201011 is a deficient number, since it is larger than the sum of its proper divisors (89223302781).
200011201011 is a wasteful number, since it uses less digits than its factorization.
200011201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25341210 (or 25341207 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 200011201011 its reverse (110102110002), we get a palindrome (310113311013).
It can be divided in two parts, 2000 and 11201011, that added together give a triangular number (11203011 = T4733).
The spelling of 200011201011 in words is "two hundred billion, eleven million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •