Base | Representation |
---|---|
bin | 1011101001000100011… |
… | …1101111011001111001 |
3 | 201010020120100100000220 |
4 | 2322101013233121321 |
5 | 11234101311033423 |
6 | 231514043050253 |
7 | 20310160221003 |
oct | 2722107573171 |
9 | 633216310026 |
10 | 200003221113 |
11 | 77903671283 |
12 | 32918810989 |
13 | 15b24ba9367 |
14 | 99746bd373 |
15 | 53088ad9e3 |
hex | 2e911ef679 |
200003221113 has 32 divisors (see below), whose sum is σ = 277476864000. Its totient is φ = 127987788096.
The previous prime is 200003221109. The next prime is 200003221123. The reversal of 200003221113 is 311122300002.
It is not a de Polignac number, because 200003221113 - 22 = 200003221109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200003221092 and 200003221101.
It is not an unprimeable number, because it can be changed into a prime (200003221123) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15262038 + ... + 15275136.
It is an arithmetic number, because the mean of its divisors is an integer number (8671152000).
Almost surely, 2200003221113 is an apocalyptic number.
It is an amenable number.
200003221113 is a deficient number, since it is larger than the sum of its proper divisors (77473642887).
200003221113 is a wasteful number, since it uses less digits than its factorization.
200003221113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14141.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 200003221113 its reverse (311122300002), we get a palindrome (511125521115).
The spelling of 200003221113 in words is "two hundred billion, three million, two hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •