Base | Representation |
---|---|
bin | 101101111110101100001010… |
… | …011111011001101001000110 |
3 | 222112000001110221100112002210 |
4 | 231332230022133121221012 |
5 | 203001133302011414342 |
6 | 1554030350255444250 |
7 | 60410631055210035 |
oct | 5576541237315106 |
9 | 875001427315083 |
10 | 202220121201222 |
11 | 59485087606653 |
12 | 1a81b745526686 |
13 | 88ab377674937 |
14 | 37d17129ca71c |
15 | 185a321bed79c |
hex | b7eb0a7d9a46 |
202220121201222 has 8 divisors (see below), whose sum is σ = 404440242402456. Its totient is φ = 67406707067072.
The previous prime is 202220121201221. The next prime is 202220121201257. The reversal of 202220121201222 is 222102121022202.
It is a sphenic number, since it is the product of 3 distinct primes.
202220121201222 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202220121201221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16851676766763 + ... + 16851676766774.
It is an arithmetic number, because the mean of its divisors is an integer number (50555030300307).
Almost surely, 2202220121201222 is an apocalyptic number.
202220121201222 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202220121201222 is a wasteful number, since it uses less digits than its factorization.
202220121201222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33703353533542.
The product of its (nonzero) digits is 512, while the sum is 21.
Adding to 202220121201222 its reverse (222102121022202), we get a palindrome (424322242223424).
The spelling of 202220121201222 in words is "two hundred two trillion, two hundred twenty billion, one hundred twenty-one million, two hundred one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •