Base | Representation |
---|---|
bin | 1010000110111011110001… |
… | …0101001001110010111000 |
3 | 1110100111210111110211202021 |
4 | 2201232330111021302320 |
5 | 2424043430423302004 |
6 | 35345451132244224 |
7 | 2224656141506464 |
oct | 241567425116270 |
9 | 43314714424667 |
10 | 11114240056504 |
11 | 35a5582845252 |
12 | 12b6020610674 |
13 | 6280b71b3120 |
14 | 2a5d0991b4a4 |
15 | 144190b44d54 |
hex | a1bbc549cb8 |
11114240056504 has 64 divisors (see below), whose sum is σ = 23426610913440. Its totient is φ = 4909190146560.
The previous prime is 11114240056453. The next prime is 11114240056531. The reversal of 11114240056504 is 40565004241111.
11114240056504 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×111142400565042 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11114240056504.
It is a congruent number.
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, 23439994 + ... + 23909449.
Almost surely, 211114240056504 is an apocalyptic number.
It is an amenable number.
11114240056504 is an abundant number, since it is smaller than the sum of its proper divisors (12312370856936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11114240056504 is a wasteful number, since it uses less digits than its factorization.
11114240056504 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47349560 (or 47349556 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 34.
Adding to 11114240056504 its reverse (40565004241111), we get a palindrome (51679244297615).
The spelling of 11114240056504 in words is "eleven trillion, one hundred fourteen billion, two hundred forty million, fifty-six thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •