Base | Representation |
---|---|
bin | 101101100001011100000110… |
… | …101001010101011101000000 |
3 | 222020212220000222021010222212 |
4 | 231201130012221111131000 |
5 | 202220220101033031422 |
6 | 1545451113151321252 |
7 | 60112460511012200 |
oct | 5541340651253500 |
9 | 866786028233885 |
10 | 200210012002112 |
11 | 5887a653346962 |
12 | 1a55605bb20228 |
13 | 879395290b458 |
14 | 37623056b0400 |
15 | 1822dc64929e2 |
hex | b61706a55740 |
200210012002112 has 84 divisors (see below), whose sum is σ = 489341330110404. Its totient is φ = 80756979609600.
The previous prime is 200210012002111. The next prime is 200210012002127. The reversal of 200210012002112 is 211200210012002.
It can be written as a sum of positive squares in 2 ways, for example, as 163965566449216 + 36244445552896 = 12804904^2 + 6020336^2 .
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200210012002111) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1877666639 + ... + 1877773262.
Almost surely, 2200210012002112 is an apocalyptic number.
It is an amenable number.
200210012002112 is an abundant number, since it is smaller than the sum of its proper divisors (289131318108292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200210012002112 is a wasteful number, since it uses less digits than its factorization.
200210012002112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3755439944 (or 3755439927 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 200210012002112 its reverse (211200210012002), we get a palindrome (411410222014114).
The spelling of 200210012002112 in words is "two hundred trillion, two hundred ten billion, twelve million, two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •