Base | Representation |
---|---|
bin | 110110110011101001110000… |
… | …100001001000100100001101 |
3 | 1011121110120210202101011122012 |
4 | 312303221300201020210031 |
5 | 223043231144313221031 |
6 | 2212354034312031005 |
7 | 101525600034565154 |
oct | 6663516041104415 |
9 | 1147416722334565 |
10 | 241044042320141 |
11 | 6a8932279802a5 |
12 | 2304bb4a092465 |
13 | a4664814c2a28 |
14 | 437484592259b |
15 | 1cd0196d3db2b |
hex | db3a7084890d |
241044042320141 has 16 divisors (see below), whose sum is σ = 245240144553600. Its totient is φ = 236881328690688.
The previous prime is 241044042320111. The next prime is 241044042320161. The reversal of 241044042320141 is 141023240440142.
It is a cyclic number.
It is not a de Polignac number, because 241044042320141 - 210 = 241044042319117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 241044042320098 and 241044042320107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (241044042320111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 129169430 + ... + 131022248.
It is an arithmetic number, because the mean of its divisors is an integer number (15327509034600).
Almost surely, 2241044042320141 is an apocalyptic number.
It is an amenable number.
241044042320141 is a deficient number, since it is larger than the sum of its proper divisors (4196102233459).
241044042320141 is a wasteful number, since it uses less digits than its factorization.
241044042320141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1861828.
The product of its (nonzero) digits is 24576, while the sum is 32.
Adding to 241044042320141 its reverse (141023240440142), we get a palindrome (382067282760283).
The spelling of 241044042320141 in words is "two hundred forty-one trillion, forty-four billion, forty-two million, three hundred twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •