Base | Representation |
---|---|
bin | 110011010001110101… |
… | …1010000111001011010 |
3 | 101112020110121021111200 |
4 | 1212203223100321122 |
5 | 3301011233210020 |
6 | 122331042135030 |
7 | 10645611224646 |
oct | 1464353207132 |
9 | 345213537450 |
10 | 110120210010 |
11 | 42779a95728 |
12 | 19413051476 |
13 | a4cc3985a5 |
14 | 5489155c26 |
15 | 2ce7940590 |
hex | 19a3ad0e5a |
110120210010 has 48 divisors (see below), whose sum is σ = 286561566720. Its totient is φ = 29339848800.
The previous prime is 110120209999. The next prime is 110120210099. The reversal of 110120210010 is 10012021011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 110120209974 and 110120210001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 427930 + ... + 635109.
It is an arithmetic number, because the mean of its divisors is an integer number (5970032640).
Almost surely, 2110120210010 is an apocalyptic number.
110120210010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110120210010 is an abundant number, since it is smaller than the sum of its proper divisors (176441356710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110120210010 is a wasteful number, since it uses less digits than its factorization.
110120210010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1064203 (or 1064200 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110120210010 its reverse (10012021011), we get a palindrome (120132231021).
The spelling of 110120210010 in words is "one hundred ten billion, one hundred twenty million, two hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •