Base | Representation |
---|---|
bin | 10000001010000101011… |
… | …011011111101111100000 |
3 | 10221010222111212022012220 |
4 | 100022011123133233200 |
5 | 121142434033440000 |
6 | 2210025550351040 |
7 | 143135156316210 |
oct | 20120533375740 |
9 | 3833874768186 |
10 | 1110340140000 |
11 | 398990076243 |
12 | 15b2367bb480 |
13 | 809210a8a00 |
14 | 3ba5288c240 |
15 | 1dd3864b1a0 |
hex | 102856dfbe0 |
1110340140000 has 720 divisors, whose sum is σ = 4507549022592. Its totient is φ = 234254592000.
The previous prime is 1110340139981. The next prime is 1110340140017. The reversal of 1110340140000 is 410430111.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 70972179 + ... + 70987821.
Almost surely, 21110340140000 is an apocalyptic number.
1110340140000 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 1110340140000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2253774511296).
1110340140000 is an abundant number, since it is smaller than the sum of its proper divisors (3397208882592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110340140000 is a wasteful number, since it uses less digits than its factorization.
1110340140000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15709 (or 15673 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1110340140000 its reverse (410430111), we get a palindrome (1110750570111).
The spelling of 1110340140000 in words is "one trillion, one hundred ten billion, three hundred forty million, one hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •