Base | Representation |
---|---|
bin | 101101111011011111010110… |
… | …001111001011100110110101 |
3 | 222111020000211100002000221011 |
4 | 231323133112033023212311 |
5 | 202434032403001431401 |
6 | 1553341340014552221 |
7 | 60356014203104611 |
oct | 5573372617134665 |
9 | 874200740060834 |
10 | 202000201202101 |
11 | 593aa893498265 |
12 | 1a7a4baa808671 |
13 | 88936ca40b743 |
14 | 37c4c0d0ca341 |
15 | 185474ea62451 |
hex | b7b7d63cb9b5 |
202000201202101 has 32 divisors (see below), whose sum is σ = 208780292206080. Its totient is φ = 195313341849600.
The previous prime is 202000201202083. The next prime is 202000201202161. The reversal of 202000201202101 is 101202102000202.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 202000201202101 - 217 = 202000201071029 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 (202000201202161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10076320660 + ... + 10076340706.
It is an arithmetic number, because the mean of its divisors is an integer number (6524384131440).
Almost surely, 2202000201202101 is an apocalyptic number.
It is an amenable number.
202000201202101 is a deficient number, since it is larger than the sum of its proper divisors (6780091003979).
202000201202101 is a wasteful number, since it uses less digits than its factorization.
202000201202101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23085.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 202000201202101 its reverse (101202102000202), we get a palindrome (303202303202303).
The spelling of 202000201202101 in words is "two hundred two trillion, two hundred one million, two hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •