Base | Representation |
---|---|
bin | 10000001111100101000… |
… | …010101000010000000000 |
3 | 10221201012121222200000000 |
4 | 100033211002220100000 |
5 | 121242024213420110 |
6 | 2212443200000000 |
7 | 143434306442460 |
oct | 20174502502000 |
9 | 3851177880000 |
10 | 1116239201280 |
11 | 3a0437a242a5 |
12 | 160402300000 |
13 | 81351292908 |
14 | 3c052103ba0 |
15 | 1e0814961c0 |
hex | 103e50a8400 |
1116239201280 has 1584 divisors, whose sum is σ = 4734125001216. Its totient is φ = 247239475200.
The previous prime is 1116239201269. The next prime is 1116239201309. The reversal of 1116239201280 is 821029326111.
1116239201280 is a `hidden beast` number, since 1 + 1 + 1 + 623 + 9 + 2 + 0 + 1 + 28 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
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, 11051873230 + ... + 11051873330.
Almost surely, 21116239201280 is an apocalyptic number.
1116239201280 is a gapful number since it is divisible by the number (10) 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 1116239201280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2367062500608).
1116239201280 is an abundant number, since it is smaller than the sum of its proper divisors (3617885799936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1116239201280 is an frugal number, since it uses more digits than its factorization.
1116239201280 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 204 (or 165 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 36.
The spelling of 1116239201280 in words is "one trillion, one hundred sixteen billion, two hundred thirty-nine million, two hundred one thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •