Base | Representation |
---|---|
bin | 1001000110101010100100… |
… | …01010011000111110101010 |
3 | 2121212220200121212212021000 |
4 | 10203111102022120332222 |
5 | 10111002403040201442 |
6 | 110325055040455430 |
7 | 4134261511620066 |
oct | 443252212307652 |
9 | 77786617785230 |
10 | 20020221022122 |
11 | 6419589928272 |
12 | 22b407761a576 |
13 | b22b8b6c6399 |
14 | 4d2daba38aa6 |
15 | 24ab8a20ed4c |
hex | 123552298faa |
20020221022122 has 16 divisors (see below), whose sum is σ = 44489380049280. Its totient is φ = 6673407007356.
The previous prime is 20020221022099. The next prime is 20020221022259. The reversal of 20020221022122 is 22122012202002.
20020221022122 is a `hidden beast` number, since 200 + 2 + 0 + 221 + 0 + 221 + 22 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 20020221022095 and 20020221022104.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 185372416818 + ... + 185372416925.
It is an arithmetic number, because the mean of its divisors is an integer number (2780586253080).
Almost surely, 220020221022122 is an apocalyptic number.
20020221022122 is an abundant number, since it is smaller than the sum of its proper divisors (24469159027158).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20020221022122 is a wasteful number, since it uses less digits than its factorization.
20020221022122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 370744833754 (or 370744833748 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 20020221022122 its reverse (22122012202002), we get a palindrome (42142233224124).
The spelling of 20020221022122 in words is "twenty trillion, twenty billion, two hundred twenty-one million, twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •