Base | Representation |
---|---|
bin | 10010110100000101… |
… | …000111101001101000 |
3 | 1221010211221201110201 |
4 | 102310011013221220 |
5 | 312332441010440 |
6 | 13140311521544 |
7 | 1313413413532 |
oct | 226405075150 |
9 | 57124851421 |
10 | 20201110120 |
11 | 8627000034 |
12 | 3ab93892b4 |
13 | 1b9c2602c9 |
14 | d98cb6852 |
15 | 7d374419a |
hex | 4b4147a68 |
20201110120 has 32 divisors (see below), whose sum is σ = 45457086600. Its totient is φ = 8079628288.
The previous prime is 20201110117. The next prime is 20201110147. The reversal of 20201110120 is 2101110202.
It can be written as a sum of positive squares in 4 ways, for example, as 17306454916 + 2894655204 = 131554^2 + 53802^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 20201110097 and 20201110106.
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, 519516 + ... + 557044.
Almost surely, 220201110120 is an apocalyptic number.
20201110120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20201110120 is an abundant number, since it is smaller than the sum of its proper divisors (25255976480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20201110120 is a wasteful number, since it uses less digits than its factorization.
20201110120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50997 (or 50993 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 20201110120 its reverse (2101110202), we get a palindrome (22302220322).
It can be divided in two parts, 20201 and 110120, that added together give a 4-th power (130321 = 194).
The spelling of 20201110120 in words is "twenty billion, two hundred one million, one hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •