Base | Representation |
---|---|
bin | 110100010111000000… |
… | …1100011111110100101 |
3 | 101202020020011102200020 |
4 | 1220232001203332211 |
5 | 3320234433424031 |
6 | 123353235305353 |
7 | 11060254242435 |
oct | 1505601437645 |
9 | 352206142606 |
10 | 112441311141 |
11 | 43760209325 |
12 | 1996044b259 |
13 | a7ac21b103 |
14 | 56295182c5 |
15 | 2dd15ce096 |
hex | 1a2e063fa5 |
112441311141 has 8 divisors (see below), whose sum is σ = 158740674624. Its totient is φ = 70551410880.
The previous prime is 112441311127. The next prime is 112441311149. The reversal of 112441311141 is 141113144211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-112441311141 is a prime.
It is a super-2 number, since 2×1124413111412 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112441311149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1102365745 + ... + 1102365846.
It is an arithmetic number, because the mean of its divisors is an integer number (19842584328).
Almost surely, 2112441311141 is an apocalyptic number.
It is an amenable number.
112441311141 is a deficient number, since it is larger than the sum of its proper divisors (46299363483).
112441311141 is a wasteful number, since it uses less digits than its factorization.
112441311141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2204731611.
The product of its digits is 384, while the sum is 24.
Adding to 112441311141 its reverse (141113144211), we get a palindrome (253554455352).
The spelling of 112441311141 in words is "one hundred twelve billion, four hundred forty-one million, three hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •