Base | Representation |
---|---|
bin | 101101011110101100010000… |
… | …101100110000011010010100 |
3 | 222020012211200111010211212110 |
4 | 231132230100230300122110 |
5 | 202204121410220010400 |
6 | 1545224245520151020 |
7 | 60063024565265550 |
oct | 5536542054603224 |
9 | 866184614124773 |
10 | 200021202110100 |
11 | 5880757405a498 |
12 | 1a525547a68470 |
13 | 877bbc2a19567 |
14 | 3757113828860 |
15 | 181d025610e50 |
hex | b5eb10b30694 |
200021202110100 has 144 divisors (see below), whose sum is σ = 700309526571648. Its totient is φ = 43029771202560.
The previous prime is 200021202110099. The next prime is 200021202110113. The reversal of 200021202110100 is 1011202120002.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2801381697 + ... + 2801453096.
It is an arithmetic number, because the mean of its divisors is an integer number (4863260601192).
Almost surely, 2200021202110100 is an apocalyptic number.
200021202110100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200021202110100 is an abundant number, since it is smaller than the sum of its proper divisors (500288324461548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200021202110100 is a wasteful number, since it uses less digits than its factorization.
200021202110100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5602834834 (or 5602834827 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 200021202110100 its reverse (1011202120002), we get a palindrome (201032404230102).
The spelling of 200021202110100 in words is "two hundred trillion, twenty-one billion, two hundred two million, one hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •