Base | Representation |
---|---|
bin | 11101101111110100011… |
… | …110100111001100000101 |
3 | 21020102110120220000101121 |
4 | 131233310132213030011 |
5 | 231443021022144031 |
6 | 4203033030553541 |
7 | 300455312630104 |
oct | 35576436471405 |
9 | 7212416800347 |
10 | 2044211131141 |
11 | 718a43988aa3 |
12 | 2902222088b1 |
13 | 11a9cabbbcba |
14 | 70d2445003b |
15 | 38294542011 |
hex | 1dbf47a7305 |
2044211131141 has 4 divisors (see below), whose sum is σ = 2044254141484. Its totient is φ = 2044168120800.
The previous prime is 2044211131139. The next prime is 2044211131147. The reversal of 2044211131141 is 1411311124402.
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 1494618722116 + 549592409025 = 1222546^2 + 741345^2 .
It is a cyclic number.
It is not a de Polignac number, because 2044211131141 - 21 = 2044211131139 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 (2044211131147) 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, 21433800 + ... + 21528961.
It is an arithmetic number, because the mean of its divisors is an integer number (511063535371).
Almost surely, 22044211131141 is an apocalyptic number.
It is an amenable number.
2044211131141 is a deficient number, since it is larger than the sum of its proper divisors (43010343).
2044211131141 is an equidigital number, since it uses as much as digits as its factorization.
2044211131141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43010342.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 2044211131141 its reverse (1411311124402), we get a palindrome (3455522255543).
The spelling of 2044211131141 in words is "two trillion, forty-four billion, two hundred eleven million, one hundred thirty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •