Base | Representation |
---|---|
bin | 101101100001100101011011… |
… | …001010110100110110100100 |
3 | 222020220211212110002020012020 |
4 | 231201211123022310312210 |
5 | 202220401100110032322 |
6 | 1545455450221423140 |
7 | 60113263513424100 |
oct | 5541453312646644 |
9 | 866824773066166 |
10 | 200220020002212 |
11 | 58883919625521 |
12 | 1a557b9370aab0 |
13 | 879488916a0c2 |
14 | 37629b4916900 |
15 | 18232aedd105c |
hex | b6195b2b4da4 |
200220020002212 has 72 divisors (see below), whose sum is σ = 560985125218560. Its totient is φ = 55360374189120.
The previous prime is 200220020002207. The next prime is 200220020002237. The reversal of 200220020002212 is 212200020022002.
200220020002212 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 200220020002191 and 200220020002200.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5492082387 + ... + 5492118842.
It is an arithmetic number, because the mean of its divisors is an integer number (7791460072480).
Almost surely, 2200220020002212 is an apocalyptic number.
It is an amenable number.
200220020002212 is an abundant number, since it is smaller than the sum of its proper divisors (360765105216348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200220020002212 is a wasteful number, since it uses less digits than its factorization.
200220020002212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10984201281 (or 10984201272 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 15.
Adding to 200220020002212 its reverse (212200020022002), we get a palindrome (412420040024214).
The spelling of 200220020002212 in words is "two hundred trillion, two hundred twenty billion, twenty million, two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •