Base | Representation |
---|---|
bin | 101101100001100110010110… |
… | …110001100101110111101000 |
3 | 222020220221110010210101222111 |
4 | 231201212112301211313220 |
5 | 202220410122111121300 |
6 | 1545500133343332104 |
7 | 60113330345431324 |
oct | 5541462661456750 |
9 | 866827403711874 |
10 | 200221020020200 |
11 | 58884292060873 |
12 | 1a5582125b1034 |
13 | 87949b83b251a |
14 | 3762a6b66a984 |
15 | 182331cab79ba |
hex | b61996c65de8 |
200221020020200 has 24 divisors (see below), whose sum is σ = 465513871547430. Its totient is φ = 80088408008000.
The previous prime is 200221020020183. The next prime is 200221020020201. The reversal of 200221020020200 is 2020020122002.
It can be written as a sum of positive squares in 3 ways, for example, as 172569681550084 + 27651338470116 = 13136578^2 + 5258454^2 .
It is not an unprimeable number, because it can be changed into a prime (200221020020201) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 500552549851 + ... + 500552550250.
Almost surely, 2200221020020200 is an apocalyptic number.
200221020020200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200221020020200 is an abundant number, since it is smaller than the sum of its proper divisors (265292851527230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200221020020200 is a wasteful number, since it uses less digits than its factorization.
200221020020200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1001105100117 (or 1001105100108 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 13.
Adding to 200221020020200 its reverse (2020020122002), we get a palindrome (202241040142202).
The spelling of 200221020020200 in words is "two hundred trillion, two hundred twenty-one billion, twenty million, twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •