Base | Representation |
---|---|
bin | 101101100011001011111101… |
… | …101001110101100111101100 |
3 | 222021022101001112001221221012 |
4 | 231203023331221311213230 |
5 | 202224202041234120322 |
6 | 1550022215311324352 |
7 | 60124242063030050 |
oct | 5543137551654754 |
9 | 867271045057835 |
10 | 200330120223212 |
11 | 589165882a8101 |
12 | 1a57539bb206b8 |
13 | 87a2084357275 |
14 | 376805b147c60 |
15 | 18260a5bc3ae2 |
hex | b632fda759ec |
200330120223212 has 12 divisors (see below), whose sum is σ = 400660240446480. Its totient is φ = 85855765809936.
The previous prime is 200330120223133. The next prime is 200330120223257. The reversal of 200330120223212 is 212322021033002.
200330120223212 is an admirable number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3577323575387 + ... + 3577323575442.
It is an arithmetic number, because the mean of its divisors is an integer number (33388353370540).
Almost surely, 2200330120223212 is an apocalyptic number.
It is an amenable number.
200330120223212 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200330120223212 is a wasteful number, since it uses less digits than its factorization.
200330120223212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7154647150840 (or 7154647150838 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 200330120223212 its reverse (212322021033002), we get a palindrome (412652141256214).
The spelling of 200330120223212 in words is "two hundred trillion, three hundred thirty billion, one hundred twenty million, two hundred twenty-three thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •