Base | Representation |
---|---|
bin | 1010010111101111101001… |
… | …0101011010011110010000 |
3 | 1111101010020200101121120220 |
4 | 2211323322111122132100 |
5 | 2443311413014333130 |
6 | 40130252524233040 |
7 | 2254562016164334 |
oct | 245737225323620 |
9 | 44333220347526 |
10 | 11403043121040 |
11 | 36a700462417a |
12 | 1341ba009b780 |
13 | 6493c1363c1c |
14 | 2b5ca59677c4 |
15 | 14b945313410 |
hex | a5efa55a790 |
11403043121040 has 80 divisors (see below), whose sum is σ = 35699428143936. Its totient is φ = 3010704448000.
The previous prime is 11403043121039. The next prime is 11403043121179. The reversal of 11403043121040 is 4012134030411.
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 (24).
It is a self number, because there is not a number n which added to its sum of digits gives 11403043121040.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 235187046 + ... + 235235525.
Almost surely, 211403043121040 is an apocalyptic number.
11403043121040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11403043121040 is an abundant number, since it is smaller than the sum of its proper divisors (24296385022896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11403043121040 is a wasteful number, since it uses less digits than its factorization.
11403043121040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 470422688 (or 470422682 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 11403043121040 its reverse (4012134030411), we get a palindrome (15415177151451).
The spelling of 11403043121040 in words is "eleven trillion, four hundred three billion, forty-three million, one hundred twenty-one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •