Base | Representation |
---|---|
bin | 10000010011011111100… |
… | …000000001100101101001 |
3 | 10222010001110210220000120 |
4 | 100103133200001211221 |
5 | 121324130422224431 |
6 | 2214420143353453 |
7 | 143643402104412 |
oct | 20233740014551 |
9 | 3863043726016 |
10 | 1120441211241 |
11 | 3a21a3943600 |
12 | 1611955b2889 |
13 | 818709c3441 |
14 | 3c330200809 |
15 | 1e22a321196 |
hex | 104df801969 |
1120441211241 has 48 divisors (see below), whose sum is σ = 1646392972224. Its totient is φ = 677274048000.
The previous prime is 1120441211221. The next prime is 1120441211243. The reversal of 1120441211241 is 1421121440211.
It is not a de Polignac number, because 1120441211241 - 25 = 1120441211209 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1120441211243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 252292581 + ... + 252297021.
It is an arithmetic number, because the mean of its divisors is an integer number (34299853588).
Almost surely, 21120441211241 is an apocalyptic number.
1120441211241 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1120441211241 is a deficient number, since it is larger than the sum of its proper divisors (525951760983).
1120441211241 is a wasteful number, since it uses less digits than its factorization.
1120441211241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6134 (or 6123 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 24.
Adding to 1120441211241 its reverse (1421121440211), we get a palindrome (2541562651452).
The spelling of 1120441211241 in words is "one trillion, one hundred twenty billion, four hundred forty-one million, two hundred eleven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •