Base | Representation |
---|---|
bin | 101101100001100111011101… |
… | …000111100111101110100100 |
3 | 222020221001111101111202110011 |
4 | 231201213131013213232210 |
5 | 202220420031222400400 |
6 | 1545500450422540004 |
7 | 60113401526000131 |
oct | 5541473507475644 |
9 | 866831441452404 |
10 | 200222200200100 |
11 | 5888483825a461 |
12 | 1a5584a1897604 |
13 | 8794b45a57420 |
14 | 3762b402bb588 |
15 | 182338b4da8ba |
hex | b619dd1e7ba4 |
200222200200100 has 36 divisors (see below), whose sum is σ = 467903880162964. Its totient is φ = 73928196996480.
The previous prime is 200222200200067. The next prime is 200222200200181. The reversal of 200222200200100 is 1002002222002.
It can be written as a sum of positive squares in 6 ways, for example, as 10720490414656 + 189501709785444 = 3274216^2 + 13765962^2 .
It is a Harshad number since it is a multiple of its sum of digits (13).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 77008537239 + ... + 77008539838.
Almost surely, 2200222200200100 is an apocalyptic number.
200222200200100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200222200200100 is an abundant number, since it is smaller than the sum of its proper divisors (267681679962864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200222200200100 is a wasteful number, since it uses less digits than its factorization.
200222200200100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154017077104 (or 154017077097 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 13.
Adding to 200222200200100 its reverse (1002002222002), we get a palindrome (201224202422102).
The spelling of 200222200200100 in words is "two hundred trillion, two hundred twenty-two billion, two hundred million, two hundred thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •