Base | Representation |
---|---|
bin | 1010010111100100011101… |
… | …1101100101110111110101 |
3 | 1111100211111112112010221021 |
4 | 2211321013131211313311 |
5 | 2443234241242040341 |
6 | 40125035043021141 |
7 | 2254424446250014 |
oct | 245710735456765 |
9 | 44324445463837 |
10 | 11400042143221 |
11 | 36a5804656116 |
12 | 13414a306a7b1 |
13 | 6490336c95c4 |
14 | 2b5a9d188a7b |
15 | 14b81bb299d1 |
hex | a5e47765df5 |
11400042143221 has 4 divisors (see below), whose sum is σ = 11895696149472. Its totient is φ = 10904388136972.
The previous prime is 11400042143209. The next prime is 11400042143227. The reversal of 11400042143221 is 12234124000411.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11400042143221 - 213 = 11400042135029 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11400042143227) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 247827003091 + ... + 247827003136.
It is an arithmetic number, because the mean of its divisors is an integer number (2973924037368).
Almost surely, 211400042143221 is an apocalyptic number.
It is an amenable number.
11400042143221 is a deficient number, since it is larger than the sum of its proper divisors (495654006251).
11400042143221 is an equidigital number, since it uses as much as digits as its factorization.
11400042143221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 495654006250.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 11400042143221 its reverse (12234124000411), we get a palindrome (23634166143632).
The spelling of 11400042143221 in words is "eleven trillion, four hundred billion, forty-two million, one hundred forty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •