Base | Representation |
---|---|
bin | 110011000000100110000011… |
… | …111011010000011100110101 |
3 | 1002102022210221202021111210112 |
4 | 303000212003323100130311 |
5 | 213401101324432334031 |
6 | 2113044535401432405 |
7 | 65153056031455433 |
oct | 6300460373203465 |
9 | 1072283852244715 |
10 | 224341240121141 |
11 | 655336495366a0 |
12 | 211b2a0349b705 |
13 | 9824399150690 |
14 | 3d582614a5d53 |
15 | 1ae096cd8962b |
hex | cc0983ed0735 |
224341240121141 has 32 divisors (see below), whose sum is σ = 268597950297600. Its totient is φ = 184691444820480.
The previous prime is 224341240121081. The next prime is 224341240121227. The reversal of 224341240121141 is 141121042143422.
It is a happy number.
It is not a de Polignac number, because 224341240121141 - 210 = 224341240120117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 224341240121098 and 224341240121107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (224341240121641) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 61469936 + ... + 65017193.
It is an arithmetic number, because the mean of its divisors is an integer number (8393685946800).
Almost surely, 2224341240121141 is an apocalyptic number.
It is an amenable number.
224341240121141 is a deficient number, since it is larger than the sum of its proper divisors (44256710176459).
224341240121141 is a wasteful number, since it uses less digits than its factorization.
224341240121141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 126487389.
The product of its (nonzero) digits is 12288, while the sum is 32.
Adding to 224341240121141 its reverse (141121042143422), we get a palindrome (365462282264563).
The spelling of 224341240121141 in words is "two hundred twenty-four trillion, three hundred forty-one billion, two hundred forty million, one hundred twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •