Base | Representation |
---|---|
bin | 1011101001110110010… |
… | …0101000100110010011 |
3 | 201010210010102121011220 |
4 | 2322131210220212103 |
5 | 11240013300401003 |
6 | 231550504340123 |
7 | 20315304646335 |
oct | 2723544504623 |
9 | 633703377156 |
10 | 200212122003 |
11 | 77a00583643 |
12 | 32976774643 |
13 | 15b5925bb5a |
14 | 999433b455 |
15 | 531bdc5353 |
hex | 2e9d928993 |
200212122003 has 8 divisors (see below), whose sum is σ = 270165755328. Its totient is φ = 131866618344.
The previous prime is 200212121981. The next prime is 200212122017. The reversal of 200212122003 is 300221212002.
It is a happy number.
200212122003 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200212122003 - 29 = 200212121491 is a prime.
It is not an unprimeable number, because it can be changed into a prime (200212122703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 402032125 + ... + 402032622.
It is an arithmetic number, because the mean of its divisors is an integer number (33770719416).
Almost surely, 2200212122003 is an apocalyptic number.
200212122003 is a deficient number, since it is larger than the sum of its proper divisors (69953633325).
200212122003 is an equidigital number, since it uses as much as digits as its factorization.
200212122003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 804064833.
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 200212122003 its reverse (300221212002), we get a palindrome (500433334005).
The spelling of 200212122003 in words is "two hundred billion, two hundred twelve million, one hundred twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •