Base | Representation |
---|---|
bin | 101101111110101100001001… |
… | …111101001001001101011101 |
3 | 222112000001110022110021120202 |
4 | 231332230021331021031131 |
5 | 203001133242212033041 |
6 | 1554030345335153245 |
7 | 60410630615655506 |
oct | 5576541175111535 |
9 | 875001408407522 |
10 | 202220112221021 |
11 | 594850825326a4 |
12 | 1a81b742515825 |
13 | 88ab37584c2cb |
14 | 37d171172dbad |
15 | 185a321027a9b |
hex | b7eb09f4935d |
202220112221021 has 16 divisors (see below), whose sum is σ = 204352342017408. Its totient is φ = 200090446584000.
The previous prime is 202220112220999. The next prime is 202220112221027. The reversal of 202220112221021 is 120122211022202.
It is a cyclic number.
It is not a de Polignac number, because 202220112221021 - 214 = 202220112204637 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202220112220984 and 202220112221002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202220112221027) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4996646816 + ... + 4996687286.
It is an arithmetic number, because the mean of its divisors is an integer number (12772021376088).
Almost surely, 2202220112221021 is an apocalyptic number.
It is an amenable number.
202220112221021 is a deficient number, since it is larger than the sum of its proper divisors (2132229796387).
202220112221021 is a wasteful number, since it uses less digits than its factorization.
202220112221021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70852.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 202220112221021 its reverse (120122211022202), we get a palindrome (322342323243223).
The spelling of 202220112221021 in words is "two hundred two trillion, two hundred twenty billion, one hundred twelve million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •