Base | Representation |
---|---|
bin | 101101101111111000000100… |
… | …111001110011111011101010 |
3 | 222101101201211200220002220201 |
4 | 231233320010321303323222 |
5 | 202332443420233242302 |
6 | 1551530551125342414 |
7 | 60244242050446324 |
oct | 5557700471637352 |
9 | 871351750802821 |
10 | 201202120212202 |
11 | 5912238159322a |
12 | 1a69639ab67a0a |
13 | 8836380bc0605 |
14 | 379833d97a614 |
15 | 183dadee85c87 |
hex | b6fe04e73eea |
201202120212202 has 8 divisors (see below), whose sum is σ = 301887695361312. Its totient is φ = 100572888425100.
The previous prime is 201202120212179. The next prime is 201202120212209. The reversal of 201202120212202 is 202212021202102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 201202120212202.
It is not an unprimeable number, because it can be changed into a prime (201202120212209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14085831574 + ... + 14085845857.
It is an arithmetic number, because the mean of its divisors is an integer number (37735961920164).
Almost surely, 2201202120212202 is an apocalyptic number.
201202120212202 is a deficient number, since it is larger than the sum of its proper divisors (100685575149110).
201202120212202 is a wasteful number, since it uses less digits than its factorization.
201202120212202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28171681004.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 201202120212202 its reverse (202212021202102), we get a palindrome (403414141414304).
The spelling of 201202120212202 in words is "two hundred one trillion, two hundred two billion, one hundred twenty million, two hundred twelve thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •