Base | Representation |
---|---|
bin | 1011101001011100000… |
… | …0100011110110110100 |
3 | 201010111110012221001222 |
4 | 2322113000203312310 |
5 | 11234302103031400 |
6 | 231531532205512 |
7 | 20312466645140 |
oct | 2722700436664 |
9 | 633443187058 |
10 | 200102002100 |
11 | 779543aa960 |
12 | 32945909898 |
13 | 15b3c4b4050 |
14 | 9983874220 |
15 | 53123c2185 |
hex | 2e97023db4 |
200102002100 has 144 divisors (see below), whose sum is σ = 583010768256. Its totient is φ = 57571776000.
The previous prime is 200102002097. The next prime is 200102002171. The reversal of 200102002100 is 1200201002.
200102002100 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2001020021002 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 899411 + ... + 1099610.
Almost surely, 2200102002100 is an apocalyptic number.
200102002100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200102002100 is an abundant number, since it is smaller than the sum of its proper divisors (382908766156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200102002100 is a wasteful number, since it uses less digits than its factorization.
200102002100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1999066 (or 1999059 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 200102002100 its reverse (1200201002), we get a palindrome (201302203102).
The spelling of 200102002100 in words is "two hundred billion, one hundred two million, two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •