Base | Representation |
---|---|
bin | 1010001000011100111001… |
… | …0011100101101010000000 |
3 | 1110110000002110101100102102 |
4 | 2202013032103211222000 |
5 | 2430010324212040000 |
6 | 35405442144405532 |
7 | 2226601205560061 |
oct | 242071623455200 |
9 | 43400073340372 |
10 | 11140311440000 |
11 | 3605641420586 |
12 | 12bb0979168a8 |
13 | 62a6b068ac72 |
14 | 2a72a02b4568 |
15 | 144bb98e93d5 |
hex | a21ce4e5a80 |
11140311440000 has 80 divisors (see below), whose sum is σ = 27733109259570. Its totient is φ = 4456124544000.
The previous prime is 11140311439993. The next prime is 11140311440021. The reversal of 11140311440000 is 4411304111.
It can be written as a sum of positive squares in 5 ways, for example, as 1218289216 + 11139093150784 = 34904^2 + 3337528^2 .
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 69546947 + ... + 69706946.
Almost surely, 211140311440000 is an apocalyptic number.
11140311440000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11140311440000 is an abundant number, since it is smaller than the sum of its proper divisors (16592797819570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11140311440000 is an frugal number, since it uses more digits than its factorization.
11140311440000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 139253927 (or 139253900 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 11140311440000 its reverse (4411304111), we get a palindrome (11144722744111).
The spelling of 11140311440000 in words is "eleven trillion, one hundred forty billion, three hundred eleven million, four hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •