Base | Representation |
---|---|
bin | 1010001000011100001110… |
… | …1011101101000010110110 |
3 | 1110102222122001000110001001 |
4 | 2202013003223231002312 |
5 | 2430004443100243332 |
6 | 35405412340353514 |
7 | 2226563612632651 |
oct | 242070353550266 |
9 | 43388561013031 |
10 | 11140133212342 |
11 | 360555a8594a2 |
12 | 12bb0480a589a |
13 | 62a682787a04 |
14 | 2a728475c898 |
15 | 144ba8e410e7 |
hex | a21c3aed0b6 |
11140133212342 has 16 divisors (see below), whose sum is σ = 17375145386112. Its totient is φ = 5351041143360.
The previous prime is 11140133212309. The next prime is 11140133212349. The reversal of 11140133212342 is 24321233104111.
It is a super-2 number, since 2×111401332123422 (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 11140133212342.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11140133212349) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 655756353 + ... + 655773340.
It is an arithmetic number, because the mean of its divisors is an integer number (1085946586632).
Almost surely, 211140133212342 is an apocalyptic number.
11140133212342 is a deficient number, since it is larger than the sum of its proper divisors (6235012173770).
11140133212342 is a wasteful number, since it uses less digits than its factorization.
11140133212342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1311529863.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 11140133212342 its reverse (24321233104111), we get a palindrome (35461366316453).
The spelling of 11140133212342 in words is "eleven trillion, one hundred forty billion, one hundred thirty-three million, two hundred twelve thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •