Base | Representation |
---|---|
bin | 11101111000001110101… |
… | …101011101100100111101 |
3 | 21021021202220111022200100 |
4 | 131320032231131210331 |
5 | 232120014214304031 |
6 | 4211125043551313 |
7 | 301225141643544 |
oct | 35701655354475 |
9 | 7237686438610 |
10 | 2053241166141 |
11 | 721858123a40 |
12 | 291b2238b539 |
13 | 11b809957189 |
14 | 7153d84315b |
15 | 386221a2de6 |
hex | 1de0eb5d93d |
2053241166141 has 24 divisors (see below), whose sum is σ = 3279731023296. Its totient is φ = 1227342162240.
The previous prime is 2053241166001. The next prime is 2053241166161. The reversal of 2053241166141 is 1416611423502.
2053241166141 is a `hidden beast` number, since 2 + 0 + 5 + 3 + 24 + 1 + 16 + 614 + 1 = 666.
It is not a de Polignac number, because 2053241166141 - 29 = 2053241165629 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2053241166096 and 2053241166105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2053241166161) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 142046265 + ... + 142060718.
It is an arithmetic number, because the mean of its divisors is an integer number (136655459304).
Almost surely, 22053241166141 is an apocalyptic number.
It is an amenable number.
2053241166141 is a deficient number, since it is larger than the sum of its proper divisors (1226489857155).
2053241166141 is a wasteful number, since it uses less digits than its factorization.
2053241166141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284107073 (or 284107070 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
Adding to 2053241166141 its reverse (1416611423502), we get a palindrome (3469852589643).
The spelling of 2053241166141 in words is "two trillion, fifty-three billion, two hundred forty-one million, one hundred sixty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •