Base | Representation |
---|---|
bin | 11101010001000001011… |
… | …111010001101011011001 |
3 | 21010021010001010212002101 |
4 | 131101001133101223121 |
5 | 230422310203144231 |
6 | 4135523451003401 |
7 | 265205002643002 |
oct | 35210137215331 |
9 | 7107101125071 |
10 | 2011143412441 |
11 | 705a15031559 |
12 | 285933a39561 |
13 | 11785b0c2347 |
14 | 6d4a88121a9 |
15 | 374ab449661 |
hex | 1d4417d1ad9 |
2011143412441 has 8 divisors (see below), whose sum is σ = 2130034763880. Its totient is φ = 1892317483008.
The previous prime is 2011143412433. The next prime is 2011143412457. The reversal of 2011143412441 is 1442143411102.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 414890574400 + 1596252838041 = 644120^2 + 1263429^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2011143412441 - 23 = 2011143412433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2011143412471) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16292196 + ... + 16415173.
It is an arithmetic number, because the mean of its divisors is an integer number (266254345485).
Almost surely, 22011143412441 is an apocalyptic number.
It is an amenable number.
2011143412441 is a deficient number, since it is larger than the sum of its proper divisors (118891351439).
2011143412441 is a wasteful number, since it uses less digits than its factorization.
2011143412441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32711003.
The product of its (nonzero) digits is 3072, while the sum is 28.
Adding to 2011143412441 its reverse (1442143411102), we get a palindrome (3453286823543).
The spelling of 2011143412441 in words is "two trillion, eleven billion, one hundred forty-three million, four hundred twelve thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •