Base | Representation |
---|---|
bin | 11101001000101100011… |
… | …011101101010101011110 |
3 | 21002102000202221122210120 |
4 | 131020230123231111132 |
5 | 230301001224033042 |
6 | 4131444215215410 |
7 | 264440250034431 |
oct | 35105433552536 |
9 | 7072022848716 |
10 | 2002200221022 |
11 | 702145911471 |
12 | 284058977566 |
13 | 116a643424c1 |
14 | 6cc9ab87818 |
15 | 3713623edec |
hex | 1d22c6ed55e |
2002200221022 has 16 divisors (see below), whose sum is σ = 4004595711120. Its totient is φ = 667367528832.
The previous prime is 2002200220997. The next prime is 2002200221027. The reversal of 2002200221022 is 2201220022002.
It is a junction number, because it is equal to n+sod(n) for n = 2002200220992 and 2002200221010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002200221027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8002747 + ... + 8249142.
It is an arithmetic number, because the mean of its divisors is an integer number (250287231945).
Almost surely, 22002200221022 is an apocalyptic number.
2002200221022 is an abundant number, since it is smaller than the sum of its proper divisors (2002395490098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002200221022 is a wasteful number, since it uses less digits than its factorization.
2002200221022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16272427.
The product of its (nonzero) digits is 128, while the sum is 15.
Adding to 2002200221022 its reverse (2201220022002), we get a palindrome (4203420243024).
It can be divided in two parts, 2002200 and 221022, that added together give a palindrome (2223222).
The spelling of 2002200221022 in words is "two trillion, two billion, two hundred million, two hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •