Base | Representation |
---|---|
bin | 110001000101100010… |
… | …0111100011001110001 |
3 | 101002002101022001221111 |
4 | 1202023010330121301 |
5 | 3211341102402423 |
6 | 120231552353321 |
7 | 10421135561332 |
oct | 1421304743161 |
9 | 332071261844 |
10 | 105412544113 |
11 | 407836a6658 |
12 | 1851a545841 |
13 | 9c2bc82476 |
14 | 515dc30289 |
15 | 2b1e4d160d |
hex | 188b13c671 |
105412544113 has 8 divisors (see below), whose sum is σ = 112281628032. Its totient is φ = 98617720896.
The previous prime is 105412544063. The next prime is 105412544213. The reversal of 105412544113 is 311445214501.
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 105412544113 - 221 = 105410446961 is a prime.
It is a super-2 number, since 2×1054125441132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105412544213) 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 7 ways as a sum of consecutive naturals, for example, 18562245 + ... + 18567922.
It is an arithmetic number, because the mean of its divisors is an integer number (14035203504).
Almost surely, 2105412544113 is an apocalyptic number.
It is an amenable number.
105412544113 is a deficient number, since it is larger than the sum of its proper divisors (6869083919).
105412544113 is a wasteful number, since it uses less digits than its factorization.
105412544113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37130351.
The product of its (nonzero) digits is 9600, while the sum is 31.
Adding to 105412544113 its reverse (311445214501), we get a palindrome (416857758614).
The spelling of 105412544113 in words is "one hundred five billion, four hundred twelve million, five hundred forty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •