Base | Representation |
---|---|
bin | 11110100100111001010… |
… | …01010110100001111111 |
3 | 10201102210010110010221011 |
4 | 33102130221112201333 |
5 | 114203112111343421 |
6 | 2122350010220051 |
7 | 135621564362203 |
oct | 17223451264177 |
9 | 3642703403834 |
10 | 1050600106111 |
11 | 375614409606 |
12 | 14b743a24627 |
13 | 780c047052a |
14 | 38bc674ab03 |
15 | 1c4ddb4a4e1 |
hex | f49ca5687f |
1050600106111 has 8 divisors (see below), whose sum is σ = 1053440017920. Its totient is φ = 1047760699392.
The previous prime is 1050600106091. The next prime is 1050600106117. The reversal of 1050600106111 is 1116010060501.
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 1050600106111 - 211 = 1050600104063 is a prime.
It is a super-2 number, since 2×10506001061112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1050600106117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4243135 + ... + 4483903.
It is an arithmetic number, because the mean of its divisors is an integer number (131680002240).
Almost surely, 21050600106111 is an apocalyptic number.
1050600106111 is a deficient number, since it is larger than the sum of its proper divisors (2839911809).
1050600106111 is a wasteful number, since it uses less digits than its factorization.
1050600106111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252545.
The product of its (nonzero) digits is 180, while the sum is 22.
Adding to 1050600106111 its reverse (1116010060501), we get a palindrome (2166610166612).
The spelling of 1050600106111 in words is "one trillion, fifty billion, six hundred million, one hundred six thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •