Base | Representation |
---|---|
bin | 1001001100011111010010… |
… | …00111110110000101001010 |
3 | 2122121001012000120102121010 |
4 | 10212033221013312011022 |
5 | 10122242204441210442 |
6 | 111001030543424350 |
7 | 4154604301634616 |
oct | 446175107660512 |
9 | 78531160512533 |
10 | 20220322210122 |
11 | 6496432821511 |
12 | 2326a00bb50b6 |
13 | b389ca9839c8 |
14 | 4dc95133a346 |
15 | 250e9c4c0b9c |
hex | 1263e91f614a |
20220322210122 has 8 divisors (see below), whose sum is σ = 40440644420256. Its totient is φ = 6740107403372.
The previous prime is 20220322210103. The next prime is 20220322210129. The reversal of 20220322210122 is 22101222302202.
It is a sphenic number, since it is the product of 3 distinct primes.
20220322210122 is an admirable number.
It is a super-2 number, since 2×202203222101222 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20220322210129) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1685026850838 + ... + 1685026850849.
It is an arithmetic number, because the mean of its divisors is an integer number (5055080552532).
Almost surely, 220220322210122 is an apocalyptic number.
20220322210122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20220322210122 is a wasteful number, since it uses less digits than its factorization.
20220322210122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3370053701692.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 20220322210122 its reverse (22101222302202), we get a palindrome (42321544512324).
The spelling of 20220322210122 in words is "twenty trillion, two hundred twenty billion, three hundred twenty-two million, two hundred ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •