Base | Representation |
---|---|
bin | 101101100001100101011010… |
… | …000110111101000101001000 |
3 | 222020220211211012121022000212 |
4 | 231201211122012331011020 |
5 | 202220401031031210440 |
6 | 1545455444344220252 |
7 | 60113263206252104 |
oct | 5541453206750510 |
9 | 866824735538025 |
10 | 200220002210120 |
11 | 5888390a583012 |
12 | 1a557b8976a688 |
13 | 879488557a939 |
14 | 37629b2404904 |
15 | 18232ad569465 |
hex | b6195a1bd148 |
200220002210120 has 32 divisors (see below), whose sum is σ = 450499982904000. Its totient is φ = 80087115918528.
The previous prime is 200220002210113. The next prime is 200220002210153. The reversal of 200220002210120 is 21012200022002.
It is a junction number, because it is equal to n+sod(n) for n = 200220002210095 and 200220002210104.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23983970 + ... + 31235729.
It is an arithmetic number, because the mean of its divisors is an integer number (14078124465750).
Almost surely, 2200220002210120 is an apocalyptic number.
200220002210120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200220002210120 is an abundant number, since it is smaller than the sum of its proper divisors (250279980693880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200220002210120 is a wasteful number, since it uses less digits than its factorization.
200220002210120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55310357 (or 55310353 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 200220002210120 its reverse (21012200022002), we get a palindrome (221232202232122).
The spelling of 200220002210120 in words is "two hundred trillion, two hundred twenty billion, two million, two hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •