Base | Representation |
---|---|
bin | 101101011111110101101111… |
… | …011000101111011110000010 |
3 | 222020111101100000122112012200 |
4 | 231133311233120233132002 |
5 | 202211420001112011320 |
6 | 1545324414510134030 |
7 | 60101520006234516 |
oct | 5537655730573602 |
9 | 866441300575180 |
10 | 200100100110210 |
11 | 58837a80a05763 |
12 | 1a5388a67b1316 |
13 | 8786487750321 |
14 | 375ac7a0a4146 |
15 | 18200e1ea1290 |
hex | b5fd6f62f782 |
200100100110210 has 48 divisors (see below), whose sum is σ = 550863805013496. Its totient is φ = 50221201595904.
The previous prime is 200100100110179. The next prime is 200100100110247. The reversal of 200100100110210 is 12011001001002.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 180196715045169 + 19903385065041 = 13423737^2 + 4461321^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 200100100110192 and 200100100110201.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 65392188049 + ... + 65392191108.
Almost surely, 2200100100110210 is an apocalyptic number.
200100100110210 is an abundant number, since it is smaller than the sum of its proper divisors (350763704903286).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200100100110210 is a wasteful number, since it uses less digits than its factorization.
200100100110210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 130784379187 (or 130784379184 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 200100100110210 its reverse (12011001001002), we get a palindrome (212111101111212).
The spelling of 200100100110210 in words is "two hundred trillion, one hundred billion, one hundred million, one hundred ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.176 sec. • engine limits •