Base | Representation |
---|---|
bin | 101101100001011101111110… |
… | …010110000000011011110001 |
3 | 222020220002012221001020020220 |
4 | 231201131332112000123301 |
5 | 202220233204132414301 |
6 | 1545452044330123253 |
7 | 60112561334303061 |
oct | 5541357626003361 |
9 | 866802187036226 |
10 | 200212020201201 |
11 | 58880493983628 |
12 | 1a556520580529 |
13 | 8793bb2996738 |
14 | 37624562a13a1 |
15 | 1822e92924936 |
hex | b6177e5806f1 |
200212020201201 has 8 divisors (see below), whose sum is σ = 268717236826944. Its totient is φ = 132590741854800.
The previous prime is 200212020201169. The next prime is 200212020201217. The reversal of 200212020201201 is 102102020212002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200212020201201 - 25 = 200212020201169 is a prime.
It is a super-2 number, since 2×2002120202012012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (200212020201101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 220984569306 + ... + 220984570211.
It is an arithmetic number, because the mean of its divisors is an integer number (33589654603368).
Almost surely, 2200212020201201 is an apocalyptic number.
It is an amenable number.
200212020201201 is a deficient number, since it is larger than the sum of its proper divisors (68505216625743).
200212020201201 is a wasteful number, since it uses less digits than its factorization.
200212020201201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 441969139671.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 200212020201201 its reverse (102102020212002), we get a palindrome (302314040413203).
The spelling of 200212020201201 in words is "two hundred trillion, two hundred twelve billion, twenty million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •