Base | Representation |
---|---|
bin | 110011010001111001… |
… | …0000110001011100000 |
3 | 101112020120222021110002 |
4 | 1212203302012023200 |
5 | 3301012213013440 |
6 | 122331144355132 |
7 | 10645632364565 |
oct | 1464362061340 |
9 | 345216867402 |
10 | 110122001120 |
11 | 4277aaa938a |
12 | 19413775aa8 |
13 | a4cc874911 |
14 | 54894a086c |
15 | 2ce7b96115 |
hex | 19a3c862e0 |
110122001120 has 48 divisors (see below), whose sum is σ = 260229449088. Its totient is φ = 44037588480.
The previous prime is 110122001113. The next prime is 110122001203. The reversal of 110122001120 is 21100221011.
110122001120 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×1101220011203 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
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, 557777 + ... + 728943.
It is an arithmetic number, because the mean of its divisors is an integer number (5421446856).
Almost surely, 2110122001120 is an apocalyptic number.
110122001120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110122001120 is an abundant number, since it is smaller than the sum of its proper divisors (150107447968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110122001120 is a wasteful number, since it uses less digits than its factorization.
110122001120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 175203 (or 175195 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 110122001120 its reverse (21100221011), we get a palindrome (131222222131).
The spelling of 110122001120 in words is "one hundred ten billion, one hundred twenty-two million, one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •