Base | Representation |
---|---|
bin | 10110101111001110000111… |
… | …110011101000000001011000 |
3 | 111010002002122110110011222122 |
4 | 112233032013303220001120 |
5 | 101101413100003311300 |
6 | 552404141400440412 |
7 | 30030622556015543 |
oct | 2657160763500130 |
9 | 433062573404878 |
10 | 100002002010200 |
11 | 2995567a0a7064 |
12 | b271084179108 |
13 | 43a51c0b45274 |
14 | 1a9a1a0a7185a |
15 | b8643542cc85 |
hex | 5af387ce8058 |
100002002010200 has 72 divisors (see below), whose sum is σ = 234783902193300. Its totient is φ = 39612442674240.
The previous prime is 100002002010199. The next prime is 100002002010203. The reversal of 100002002010200 is 2010200200001.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100002002010203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 21443570 + ... + 25687169.
Almost surely, 2100002002010200 is an apocalyptic number.
100002002010200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100002002010200 is an abundant number, since it is smaller than the sum of its proper divisors (134781900183100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100002002010200 is a wasteful number, since it uses less digits than its factorization.
100002002010200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47130961 (or 47130849 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 100002002010200 its reverse (2010200200001), we get a palindrome (102012202210201).
The spelling of 100002002010200 in words is "one hundred trillion, two billion, two million, ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •