Base | Representation |
---|---|
bin | 10000001100100101111… |
… | …100011110011100100000 |
3 | 10221101221012012212201122 |
4 | 100030211330132130200 |
5 | 121213442440440000 |
6 | 2211153110551412 |
7 | 143261666406155 |
oct | 20144574363440 |
9 | 3841835185648 |
10 | 1113033140000 |
11 | 39a042210a81 |
12 | 15b868668568 |
13 | 80c5ccb1232 |
14 | 3bc2a3bc22c |
15 | 1de44c9c085 |
hex | 10325f1e720 |
1113033140000 has 240 divisors, whose sum is σ = 2761540024320. Its totient is φ = 441442560000.
The previous prime is 1113033139969. The next prime is 1113033140027. The reversal of 1113033140000 is 413303111.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 2136339740 + ... + 2136340260.
It is an arithmetic number, because the mean of its divisors is an integer number (11506416768).
Almost surely, 21113033140000 is an apocalyptic number.
1113033140000 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 1113033140000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1380770012160).
1113033140000 is an abundant number, since it is smaller than the sum of its proper divisors (1648506884320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113033140000 is an equidigital number, since it uses as much as digits as its factorization.
1113033140000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1253 (or 1230 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1113033140000 its reverse (413303111), we get a palindrome (1113446443111).
The spelling of 1113033140000 in words is "one trillion, one hundred thirteen billion, thirty-three million, one hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •