Base | Representation |
---|---|
bin | 110011010001110111… |
… | …0010110101001100000 |
3 | 101112020112010102121022 |
4 | 1212203232112221200 |
5 | 3301011440120000 |
6 | 122331111345012 |
7 | 10645621140305 |
oct | 1464356265140 |
9 | 345215112538 |
10 | 110121020000 |
11 | 4277a499242 |
12 | 19413382168 |
13 | a4cc5c0184 |
14 | 54892c70ac |
15 | 2ce7a50585 |
hex | 19a3b96a60 |
110121020000 has 60 divisors (see below), whose sum is σ = 270914276556. Its totient is φ = 44048400000.
The previous prime is 110121019993. The next prime is 110121020011. The reversal of 110121020000 is 20121011.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a self number, because there is not a number n which added to its sum of digits gives 110121020000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 2733026 + ... + 2773025.
Almost surely, 2110121020000 is an apocalyptic number.
110121020000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110121020000 is an abundant number, since it is smaller than the sum of its proper divisors (160793256556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110121020000 is an frugal number, since it uses more digits than its factorization.
110121020000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5506081 (or 5506058 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 110121020000 its reverse (20121011), we get a palindrome (110141141011).
The spelling of 110121020000 in words is "one hundred ten billion, one hundred twenty-one million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •