Base | Representation |
---|---|
bin | 10000001101100100011… |
… | …000110001110011000000 |
3 | 10221111122012110210221100 |
4 | 100031210120301303000 |
5 | 121223114132343223 |
6 | 2211445052454400 |
7 | 143326650046110 |
oct | 20154430616300 |
9 | 3844565423840 |
10 | 1114080746688 |
11 | 39a52a5a0428 |
12 | 15babb47a400 |
13 | 81099049350 |
14 | 3bcc959d040 |
15 | 1dea6c34043 |
hex | 10364631cc0 |
1114080746688 has 1008 divisors, whose sum is σ = 4123093811200. Its totient is φ = 280043495424.
The previous prime is 1114080746677. The next prime is 1114080746747. The reversal of 1114080746688 is 8866470804111.
1114080746688 is a `hidden beast` number, since 11 + 14 + 0 + 80 + 7 + 466 + 88 = 666.
It is a tau number, because it is divible by the number of its divisors (1008).
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 5598395613 + ... + 5598395811.
Almost surely, 21114080746688 is an apocalyptic number.
1114080746688 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1114080746688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2061546905600).
1114080746688 is an abundant number, since it is smaller than the sum of its proper divisors (3009013064512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1114080746688 is a wasteful number, since it uses less digits than its factorization.
1114080746688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 422 (or 380 counting only the distinct ones).
The product of its (nonzero) digits is 2064384, while the sum is 54.
The spelling of 1114080746688 in words is "one trillion, one hundred fourteen billion, eighty million, seven hundred forty-six thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •