Base | Representation |
---|---|
bin | 110011010100100001… |
… | …0100111111111110100 |
3 | 101112110201222021000202 |
4 | 1212221002213333310 |
5 | 3301202304020040 |
6 | 122344015300032 |
7 | 10651053261545 |
oct | 1465102477764 |
9 | 345421867022 |
10 | 110210220020 |
11 | 4281588356a |
12 | 1943921a618 |
13 | a514c21c54 |
14 | 54970a64cc |
15 | 2d007c0015 |
hex | 19a90a7ff4 |
110210220020 has 48 divisors (see below), whose sum is σ = 234756144000. Its totient is φ = 43453011840.
The previous prime is 110210220017. The next prime is 110210220041. The reversal of 110210220020 is 20022012011.
It is a happy number.
110210220020 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 110210219983 and 110210220010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9748331 + ... + 9759629.
It is an arithmetic number, because the mean of its divisors is an integer number (4890753000).
Almost surely, 2110210220020 is an apocalyptic number.
110210220020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110210220020 is an abundant number, since it is smaller than the sum of its proper divisors (124545923980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110210220020 is a wasteful number, since it uses less digits than its factorization.
110210220020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18248 (or 18246 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 110210220020 its reverse (20022012011), we get a palindrome (130232232031).
The spelling of 110210220020 in words is "one hundred ten billion, two hundred ten million, two hundred twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •