Base | Representation |
---|---|
bin | 1010011000010001011100… |
… | …1010011000111111011000 |
3 | 1111101222200000221110010222 |
4 | 2212010113022120333120 |
5 | 2443434003334031430 |
6 | 40134353134455212 |
7 | 2255332614320516 |
oct | 246042712307730 |
9 | 44358600843128 |
10 | 11412116705240 |
11 | 36aa940404299 |
12 | 13438b2964508 |
13 | 64a209139264 |
14 | 2b64c6a554b6 |
15 | 14bcc6bc79e5 |
hex | a6117298fd8 |
11412116705240 has 16 divisors (see below), whose sum is σ = 25677262586880. Its totient is φ = 4564846682080.
The previous prime is 11412116705219. The next prime is 11412116705257. The reversal of 11412116705240 is 4250761121411.
It is a self number, because there is not a number n which added to its sum of digits gives 11412116705240.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 142651458776 + ... + 142651458855.
It is an arithmetic number, because the mean of its divisors is an integer number (1604828911680).
Almost surely, 211412116705240 is an apocalyptic number.
11412116705240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11412116705240 is an abundant number, since it is smaller than the sum of its proper divisors (14265145881640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11412116705240 is a wasteful number, since it uses less digits than its factorization.
11412116705240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285302917642 (or 285302917638 counting only the distinct ones).
The product of its (nonzero) digits is 13440, while the sum is 35.
Adding to 11412116705240 its reverse (4250761121411), we get a palindrome (15662877826651).
The spelling of 11412116705240 in words is "eleven trillion, four hundred twelve billion, one hundred sixteen million, seven hundred five thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •