Base | Representation |
---|---|
bin | 101101111110011011011001… |
… | …101001111001101101000110 |
3 | 222111221100000112200102110202 |
4 | 231332123121221321231012 |
5 | 203000334421213014342 |
6 | 1554014212242250502 |
7 | 60406423036426220 |
oct | 5576333151715506 |
9 | 874840015612422 |
10 | 202202122001222 |
11 | 59478490520252 |
12 | 1a818161656a32 |
13 | 88a9769664535 |
14 | 37d08c632b410 |
15 | 1859b1b952332 |
hex | b7e6d9a79b46 |
202202122001222 has 32 divisors (see below), whose sum is σ = 347104488245760. Its totient is φ = 86540017717440.
The previous prime is 202202122001179. The next prime is 202202122001281. The reversal of 202202122001222 is 222100221202202.
202202122001222 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 202202122001194 and 202202122001203.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 67614653 + ... + 70541799.
It is an arithmetic number, because the mean of its divisors is an integer number (10847015257680).
Almost surely, 2202202122001222 is an apocalyptic number.
202202122001222 is a deficient number, since it is larger than the sum of its proper divisors (144902366244538).
202202122001222 is a wasteful number, since it uses less digits than its factorization.
202202122001222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2933876.
The product of its (nonzero) digits is 512, while the sum is 20.
Adding to 202202122001222 its reverse (222100221202202), we get a palindrome (424302343203424).
The spelling of 202202122001222 in words is "two hundred two trillion, two hundred two billion, one hundred twenty-two million, one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •