Base | Representation |
---|---|
bin | 11101110101011011111… |
… | …001010001010110101101 |
3 | 21021000000211102012200021 |
4 | 131311123321101112231 |
5 | 232042343212441031 |
6 | 4205511235002141 |
7 | 301060613102215 |
oct | 35653371212655 |
9 | 7230024365607 |
10 | 2050241140141 |
11 | 720558746007 |
12 | 291425739351 |
13 | 11b44c263b6c |
14 | 71337231245 |
15 | 384e8b06511 |
hex | 1dd5be515ad |
2050241140141 has 4 divisors (see below), whose sum is σ = 2088924935292. Its totient is φ = 2011557344992.
The previous prime is 2050241140139. The next prime is 2050241140249. The reversal of 2050241140141 is 1410411420502.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1349581741225 + 700659398916 = 1161715^2 + 837054^2 .
It is a cyclic number.
It is not a de Polignac number, because 2050241140141 - 21 = 2050241140139 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 (2050241140741) 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, 19341897496 + ... + 19341897601.
It is an arithmetic number, because the mean of its divisors is an integer number (522231233823).
Almost surely, 22050241140141 is an apocalyptic number.
It is an amenable number.
2050241140141 is a deficient number, since it is larger than the sum of its proper divisors (38683795151).
2050241140141 is an equidigital number, since it uses as much as digits as its factorization.
2050241140141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38683795150.
The product of its (nonzero) digits is 1280, while the sum is 25.
Adding to 2050241140141 its reverse (1410411420502), we get a palindrome (3460652560643).
The spelling of 2050241140141 in words is "two trillion, fifty billion, two hundred forty-one million, one hundred forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •