Base | Representation |
---|---|
bin | 101101011110011010100100… |
… | …110011101100011010011100 |
3 | 222020011000200001010102000221 |
4 | 231132122210303230122130 |
5 | 202203314012300321340 |
6 | 1545211425310531124 |
7 | 60061453156113556 |
oct | 5536324463543234 |
9 | 866130601112027 |
10 | 200002212120220 |
11 | 587aa509770a84 |
12 | 1a521928206aa4 |
13 | 877a187675163 |
14 | 37562317384d6 |
15 | 181c7b33a244a |
hex | b5e6a4cec69c |
200002212120220 has 48 divisors (see below), whose sum is σ = 420166315634688. Its totient is φ = 79970096243520.
The previous prime is 200002212120121. The next prime is 200002212120251. The reversal of 200002212120220 is 22021212200002.
It is a junction number, because it is equal to n+sod(n) for n = 200002212120194 and 200002212120203.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 577522357 + ... + 577868563.
It is an arithmetic number, because the mean of its divisors is an integer number (8753464909056).
Almost surely, 2200002212120220 is an apocalyptic number.
200002212120220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200002212120220 is an abundant number, since it is smaller than the sum of its proper divisors (220164103514468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200002212120220 is a wasteful number, since it uses less digits than its factorization.
200002212120220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 357250 (or 357248 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 200002212120220 its reverse (22021212200002), we get a palindrome (222023424320222).
The spelling of 200002212120220 in words is "two hundred trillion, two billion, two hundred twelve million, one hundred twenty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •