Base | Representation |
---|---|
bin | 1010010100000101101100… |
… | …1110001101101011011110 |
3 | 1111011010011002222112012112 |
4 | 2211001123032031223132 |
5 | 2441244304443123032 |
6 | 40041345231434022 |
7 | 2250206551345556 |
oct | 245013316155336 |
9 | 44133132875175 |
10 | 11340244114142 |
11 | 3682409187879 |
12 | 1331994985912 |
13 | 6434c3a66848 |
14 | 2b2c2946c166 |
15 | 149ebbec01b2 |
hex | a505b38dade |
11340244114142 has 8 divisors (see below), whose sum is σ = 17470105797576. Its totient is φ = 5516875514952.
The previous prime is 11340244114099. The next prime is 11340244114169. The reversal of 11340244114142 is 24141144204311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×113402441141422 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11340244114099 and 11340244114108.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 76623270968 + ... + 76623271115.
It is an arithmetic number, because the mean of its divisors is an integer number (2183763224697).
Almost surely, 211340244114142 is an apocalyptic number.
11340244114142 is a deficient number, since it is larger than the sum of its proper divisors (6129861683434).
11340244114142 is a wasteful number, since it uses less digits than its factorization.
11340244114142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153246542122.
The product of its (nonzero) digits is 12288, while the sum is 32.
Adding to 11340244114142 its reverse (24141144204311), we get a palindrome (35481388318453).
The spelling of 11340244114142 in words is "eleven trillion, three hundred forty billion, two hundred forty-four million, one hundred fourteen thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •