Base | Representation |
---|---|
bin | 110011010001110101… |
… | …0110110100010000100 |
3 | 101112020110101210101001 |
4 | 1212203222312202010 |
5 | 3301011221231040 |
6 | 122331035543044 |
7 | 10645610265055 |
oct | 1464352664204 |
9 | 345213353331 |
10 | 110120102020 |
11 | 42779a21585 |
12 | 19412bbaa84 |
13 | a4cc35b3a6 |
14 | 548912872c |
15 | 2ce791d59a |
hex | 19a3ab6884 |
110120102020 has 48 divisors (see below), whose sum is σ = 244964079360. Its totient is φ = 41438559744.
The previous prime is 110120102009. The next prime is 110120102039. The reversal of 110120102020 is 20201021011.
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 = 110120101988 and 110120102006.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 706771 + ... + 848389.
It is an arithmetic number, because the mean of its divisors is an integer number (5103418320).
Almost surely, 2110120102020 is an apocalyptic number.
110120102020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110120102020 is an abundant number, since it is smaller than the sum of its proper divisors (134843977340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110120102020 is a wasteful number, since it uses less digits than its factorization.
110120102020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143932 (or 143930 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 110120102020 its reverse (20201021011), we get a palindrome (130321123031).
The spelling of 110120102020 in words is "one hundred ten billion, one hundred twenty million, one hundred two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •