Base | Representation |
---|---|
bin | 101101100001011110111110… |
… | …110101100010110011111111 |
3 | 222020220012000100000222201002 |
4 | 231201132332311202303333 |
5 | 202220242413131212203 |
6 | 1545452343541240515 |
7 | 60112630213235420 |
oct | 5541367665426377 |
9 | 866805010028632 |
10 | 200213102210303 |
11 | 58880999720026 |
12 | 1a556782a0313b |
13 | 8794025bb8600 |
14 | 3762519c79647 |
15 | 1823007904d88 |
hex | b617bed62cff |
200213102210303 has 12 divisors (see below), whose sum is σ = 247770060555888. Its totient is φ = 158410366583040.
The previous prime is 200213102210281. The next prime is 200213102210327. The reversal of 200213102210303 is 303012201312002.
It is not a de Polignac number, because 200213102210303 - 212 = 200213102206207 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200213102210383) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 84620921138 + ... + 84620923503.
It is an arithmetic number, because the mean of its divisors is an integer number (20647505046324).
Almost surely, 2200213102210303 is an apocalyptic number.
200213102210303 is a deficient number, since it is larger than the sum of its proper divisors (47556958345585).
200213102210303 is a wasteful number, since it uses less digits than its factorization.
200213102210303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169241844674 (or 169241844661 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 200213102210303 its reverse (303012201312002), we get a palindrome (503225303522305).
The spelling of 200213102210303 in words is "two hundred trillion, two hundred thirteen billion, one hundred two million, two hundred ten thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •