Base | Representation |
---|---|
bin | 101101100000001010001000… |
… | …110010011001010011000110 |
3 | 222020120110212100020011222120 |
4 | 231200022020302121103012 |
5 | 202212244324240231042 |
6 | 1545342440024310410 |
7 | 60103223513501556 |
oct | 5540121062312306 |
9 | 866513770204876 |
10 | 200122001102022 |
11 | 5884629a4a7a9a |
12 | 1a540b99312406 |
13 | 8788567c1808c |
14 | 375bd56a31166 |
15 | 1820974a73dec |
hex | b60288c994c6 |
200122001102022 has 64 divisors (see below), whose sum is σ = 423890268272064. Its totient is φ = 62768189952000.
The previous prime is 200122001102021. The next prime is 200122001102053. The reversal of 200122001102022 is 220201100221002.
It is a junction number, because it is equal to n+sod(n) for n = 200122001101992 and 200122001102010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200122001102021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13861736988 + ... + 13861751424.
It is an arithmetic number, because the mean of its divisors is an integer number (6623285441751).
Almost surely, 2200122001102022 is an apocalyptic number.
200122001102022 is an abundant number, since it is smaller than the sum of its proper divisors (223768267170042).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200122001102022 is a wasteful number, since it uses less digits than its factorization.
200122001102022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37913.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 200122001102022 its reverse (220201100221002), we get a palindrome (420323101323024).
The spelling of 200122001102022 in words is "two hundred trillion, one hundred twenty-two billion, one million, one hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •