Base | Representation |
---|---|
bin | 101101100011001101000100… |
… | …000101111111110101011011 |
3 | 222021022111002212210221220202 |
4 | 231203031010011333311123 |
5 | 202224212001303311303 |
6 | 1550022532445212415 |
7 | 60124313263041140 |
oct | 5543150405776533 |
9 | 867274085727822 |
10 | 200331302010203 |
11 | 589170343a4171 |
12 | 1a57566b86110b |
13 | 87a2212142800 |
14 | 37681300963c7 |
15 | 1826124812c88 |
hex | b6334417fd5b |
200331302010203 has 12 divisors (see below), whose sum is σ = 247916336555088. Its totient is φ = 158503887303840.
The previous prime is 200331302010179. The next prime is 200331302010209. The reversal of 200331302010203 is 302010203133002.
It is not a de Polignac number, because 200331302010203 - 26 = 200331302010139 is a prime.
It is a super-2 number, since 2×2003313020102032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200331302010209) 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, 84670878788 + ... + 84670881153.
It is an arithmetic number, because the mean of its divisors is an integer number (20659694712924).
Almost surely, 2200331302010203 is an apocalyptic number.
200331302010203 is a deficient number, since it is larger than the sum of its proper divisors (47585034544885).
200331302010203 is a wasteful number, since it uses less digits than its factorization.
200331302010203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169341759974 (or 169341759961 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 200331302010203 its reverse (302010203133002), we get a palindrome (502341505143205).
The spelling of 200331302010203 in words is "two hundred trillion, three hundred thirty-one billion, three hundred two million, ten thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •