Base | Representation |
---|---|
bin | 1001001001101000100011… |
… | …10010000100111111110100 |
3 | 2122020122222010012000010122 |
4 | 10210310101302010333310 |
5 | 10114140301322401400 |
6 | 110444004215311112 |
7 | 4144532241641315 |
oct | 444642162047764 |
9 | 78218863160118 |
10 | 20122220122100 |
11 | 6458870745808 |
12 | 230b9a297b498 |
13 | b2c695426605 |
14 | 4d7cc639c60c |
15 | 24d659bd0685 |
hex | 124d11c84ff4 |
20122220122100 has 72 divisors (see below), whose sum is σ = 43693923097440. Its totient is φ = 8043598442880.
The previous prime is 20122220122097. The next prime is 20122220122153. The reversal of 20122220122100 is 122102222102.
It is a happy number.
It is a super-2 number, since 2×201222201221002 (a number of 27 digits) contains 22 as substring.
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, 1752342959 + ... + 1752354441.
It is an arithmetic number, because the mean of its divisors is an integer number (606860043020).
Almost surely, 220122220122100 is an apocalyptic number.
20122220122100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20122220122100 is an abundant number, since it is smaller than the sum of its proper divisors (23571702975340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20122220122100 is a wasteful number, since it uses less digits than its factorization.
20122220122100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21489 (or 21482 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 20122220122100 its reverse (122102222102), we get a palindrome (20244322344202).
The spelling of 20122220122100 in words is "twenty trillion, one hundred twenty-two billion, two hundred twenty million, one hundred twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •