Base | Representation |
---|---|
bin | 1011101001011110001… |
… | …1010011101101011011 |
3 | 201010112002100201010202 |
4 | 2322113203103231123 |
5 | 11234311421023003 |
6 | 231532455332415 |
7 | 20312640243536 |
oct | 2722743235533 |
9 | 633462321122 |
10 | 200111111003 |
11 | 77959561581 |
12 | 3294898110b |
13 | 15b4135312b |
14 | 9984b65a1d |
15 | 53130c1088 |
hex | 2e978d3b5b |
200111111003 has 8 divisors (see below), whose sum is σ = 213181147200. Its totient is φ = 187294862088.
The previous prime is 200111110939. The next prime is 200111111017. The reversal of 200111111003 is 300111111002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200111111003 - 26 = 200111110939 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200111111203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 63445193 + ... + 63448346.
It is an arithmetic number, because the mean of its divisors is an integer number (26647643400).
Almost surely, 2200111111003 is an apocalyptic number.
200111111003 is a deficient number, since it is larger than the sum of its proper divisors (13070036197).
200111111003 is a wasteful number, since it uses less digits than its factorization.
200111111003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126893641.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 200111111003 its reverse (300111111002), we get a palindrome (500222222005).
Subtracting 200111111003 from its reverse (300111111002), we obtain a palindrome (99999999999).
The spelling of 200111111003 in words is "two hundred billion, one hundred eleven million, one hundred eleven thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •