Base | Representation |
---|---|
bin | 110001011011010011… |
… | …1011101000100110111 |
3 | 101010222021210122022100 |
4 | 1202312213131010313 |
5 | 3214340102324002 |
6 | 120432245033143 |
7 | 10445215464636 |
oct | 1426647350467 |
9 | 333867718270 |
10 | 106143011127 |
11 | 41018a652aa |
12 | 186a30b57b3 |
13 | a0173cb27a |
14 | 51ccc5951d |
15 | 2b636c111c |
hex | 18b69dd137 |
106143011127 has 6 divisors (see below), whose sum is σ = 153317682752. Its totient is φ = 70762007412.
The previous prime is 106143011087. The next prime is 106143011153. The reversal of 106143011127 is 721110341601.
106143011127 is a `hidden beast` number, since 1 + 0 + 614 + 30 + 1 + 1 + 12 + 7 = 666.
It is not a de Polignac number, because 106143011127 - 216 = 106142945591 is a prime.
It is a super-2 number, since 2×1061430111272 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 106143011127.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106143012127) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5896833943 + ... + 5896833960.
Almost surely, 2106143011127 is an apocalyptic number.
106143011127 is a deficient number, since it is larger than the sum of its proper divisors (47174671625).
106143011127 is a wasteful number, since it uses less digits than its factorization.
106143011127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11793667909 (or 11793667906 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 27.
Adding to 106143011127 its reverse (721110341601), we get a palindrome (827253352728).
The spelling of 106143011127 in words is "one hundred six billion, one hundred forty-three million, eleven thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •