Base | Representation |
---|---|
bin | 101101100001011110000011… |
… | …001110100000011010001101 |
3 | 222020220002102122012012020021 |
4 | 231201132003032200122031 |
5 | 202220233341120333401 |
6 | 1545452100414022141 |
7 | 60112563350513440 |
oct | 5541360316403215 |
9 | 866802378165207 |
10 | 200212102121101 |
11 | 58880526146224 |
12 | 1a556543aa7951 |
13 | 8793bc6949955 |
14 | 3762463107657 |
15 | 1822e99c072a1 |
hex | b617833a068d |
200212102121101 has 32 divisors (see below), whose sum is σ = 230107948083200. Its totient is φ = 170642107883520.
The previous prime is 200212102121093. The next prime is 200212102121131. The reversal of 200212102121101 is 101121201212002.
It is not a de Polignac number, because 200212102121101 - 23 = 200212102121093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200212102121131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3243373405 + ... + 3243435133.
It is an arithmetic number, because the mean of its divisors is an integer number (7190873377600).
Almost surely, 2200212102121101 is an apocalyptic number.
It is an amenable number.
200212102121101 is a deficient number, since it is larger than the sum of its proper divisors (29895845962099).
200212102121101 is a wasteful number, since it uses less digits than its factorization.
200212102121101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64829.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 200212102121101 its reverse (101121201212002), we get a palindrome (301333303333103).
Subtracting from 200212102121101 its reverse (101121201212002), we obtain a palindrome (99090900909099).
The spelling of 200212102121101 in words is "two hundred trillion, two hundred twelve billion, one hundred two million, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •