Base | Representation |
---|---|
bin | 110011100101111001… |
… | …0001101110101110100 |
3 | 101120222100210201001010 |
4 | 1213023302031311310 |
5 | 3303401014334030 |
6 | 122521521032220 |
7 | 11001361663662 |
oct | 1471362156564 |
9 | 346870721033 |
10 | 110793121140 |
11 | 42a94912829 |
12 | 19580485670 |
13 | a5a8911a60 |
14 | 551067bc32 |
15 | 2d36a616b0 |
hex | 19cbc8dd74 |
110793121140 has 96 divisors (see below), whose sum is σ = 353735907840. Its totient is φ = 25667905536.
The previous prime is 110793121139. The next prime is 110793121151. The reversal of 110793121140 is 41121397011.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 110793121098 and 110793121107.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4164460 + ... + 4190979.
It is an arithmetic number, because the mean of its divisors is an integer number (3684749040).
Almost surely, 2110793121140 is an apocalyptic number.
110793121140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110793121140 is an abundant number, since it is smaller than the sum of its proper divisors (242942786700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110793121140 is a wasteful number, since it uses less digits than its factorization.
110793121140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8355481 (or 8355479 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 30.
The spelling of 110793121140 in words is "one hundred ten billion, seven hundred ninety-three million, one hundred twenty-one thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •