Base | Representation |
---|---|
bin | 10010110101001101… |
… | …101001000001110000 |
3 | 1221012011201120202210 |
4 | 102311031221001300 |
5 | 312402322334300 |
6 | 13142231212120 |
7 | 1314034123446 |
oct | 226515510160 |
9 | 57164646683 |
10 | 20220121200 |
11 | 8636805374 |
12 | 3b03817040 |
13 | 1ba3188576 |
14 | d9b624b96 |
15 | 7d524c050 |
hex | 4b5369070 |
20220121200 has 120 divisors (see below), whose sum is σ = 64806195888. Its totient is φ = 5389168640.
The previous prime is 20220121193. The next prime is 20220121247. The reversal of 20220121200 is 212102202.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3228472 + ... + 3234728.
Almost surely, 220220121200 is an apocalyptic number.
20220121200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20220121200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32403097944).
20220121200 is an abundant number, since it is smaller than the sum of its proper divisors (44586074688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20220121200 is a wasteful number, since it uses less digits than its factorization.
20220121200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8971 (or 8960 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 20220121200 its reverse (212102202), we get a palindrome (20432223402).
The spelling of 20220121200 in words is "twenty billion, two hundred twenty million, one hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •