Base | Representation |
---|---|
bin | 1001000110001001000000… |
… | …00010011010001101010110 |
3 | 2121211012011201112020200110 |
4 | 10203010200002122031112 |
5 | 10110204001222400042 |
6 | 110312514532023450 |
7 | 4133053111303125 |
oct | 443044002321526 |
9 | 77735151466613 |
10 | 20002200200022 |
11 | 6411981613967 |
12 | 22b0688461b86 |
13 | b21279085441 |
14 | 4d217c54babc |
15 | 24a4830e209c |
hex | 12312009a356 |
20002200200022 has 96 divisors (see below), whose sum is σ = 44468055063072. Its totient is φ = 5990399041536.
The previous prime is 20002200200011. The next prime is 20002200200029. The reversal of 20002200200022 is 22000200220002.
It is a junction number, because it is equal to n+sod(n) for n = 20002200199980 and 20002200200007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20002200200029) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 459198 + ... + 6341550.
It is an arithmetic number, because the mean of its divisors is an integer number (463208906907).
Almost surely, 220002200200022 is an apocalyptic number.
20002200200022 is an abundant number, since it is smaller than the sum of its proper divisors (24465854863050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20002200200022 is a wasteful number, since it uses less digits than its factorization.
20002200200022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5882482 (or 5882465 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 12.
Adding to 20002200200022 its reverse (22000200220002), we get a palindrome (42002400420024).
It can be divided in two parts, 20002200 and 200022, that multiplied together give a square (4000880048400 = 20002202).
The spelling of 20002200200022 in words is "twenty trillion, two billion, two hundred million, two hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •