Base | Representation |
---|---|
bin | 101101100001011100000101… |
… | …111011100011101111010000 |
3 | 222020212220000010200110221021 |
4 | 231201130011323203233100 |
5 | 202220220040000031000 |
6 | 1545451112042205224 |
7 | 60112460304012352 |
oct | 5541340573435720 |
9 | 866786003613837 |
10 | 200210000002000 |
11 | 5887a6475a000a |
12 | 1a556057ab3814 |
13 | 87939502993b1 |
14 | 3762303c690d2 |
15 | 1822dc53c211a |
hex | b61705ee3bd0 |
200210000002000 has 40 divisors (see below), whose sum is σ = 484107780009672. Its totient is φ = 80084000000000.
The previous prime is 200210000001971. The next prime is 200210000002039. The reversal of 200210000002000 is 200000012002.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 40193875538496 + 160016124463504 = 6339864^2 + 12649748^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
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, 50052498001 + ... + 50052502000.
Almost surely, 2200210000002000 is an apocalyptic number.
200210000002000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200210000002000 is an abundant number, since it is smaller than the sum of its proper divisors (283897780007672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200210000002000 is a wasteful number, since it uses less digits than its factorization.
200210000002000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100105000024 (or 100105000008 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 7.
Adding to 200210000002000 its reverse (200000012002), we get a palindrome (200410000014002).
The spelling of 200210000002000 in words is "two hundred trillion, two hundred ten billion, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •