Base | Representation |
---|---|
bin | 101101100001011100001100… |
… | …100111010000010110011000 |
3 | 222020212220021221122200012210 |
4 | 231201130030213100112120 |
5 | 202220220302200321331 |
6 | 1545451131125235120 |
7 | 60112463135005542 |
oct | 5541341447202630 |
9 | 866786257580183 |
10 | 200210112120216 |
11 | 5887a6a49090a0 |
12 | 1a556089562aa0 |
13 | 879396a593933 |
14 | 3762314ad2692 |
15 | 1822dd016c446 |
hex | b6170c9d0598 |
200210112120216 has 64 divisors (see below), whose sum is σ = 546029466405120. Its totient is φ = 60669521179520.
The previous prime is 200210112120149. The next prime is 200210112120217. The reversal of 200210112120216 is 612021211012002.
It is a junction number, because it is equal to n+sod(n) for n = 200210112120192 and 200210112120201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200210112120217) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 86241901 + ... + 88532963.
It is an arithmetic number, because the mean of its divisors is an integer number (8531710412580).
Almost surely, 2200210112120216 is an apocalyptic number.
It is an amenable number.
200210112120216 is an abundant number, since it is smaller than the sum of its proper divisors (345819354284904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200210112120216 is a wasteful number, since it uses less digits than its factorization.
200210112120216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2622096 (or 2622092 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 200210112120216 its reverse (612021211012002), we get a palindrome (812231323132218).
The spelling of 200210112120216 in words is "two hundred trillion, two hundred ten billion, one hundred twelve million, one hundred twenty thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •