Base | Representation |
---|---|
bin | 110001011000100011… |
… | …0100100100110010001 |
3 | 101010201211201211220101 |
4 | 1202301012210212101 |
5 | 3214142412130410 |
6 | 120415142212401 |
7 | 10443013264036 |
oct | 1426106444621 |
9 | 333654654811 |
10 | 106050505105 |
11 | 40a80822146 |
12 | 18678124101 |
13 | a0011ac78c |
14 | 51c085938d |
15 | 2b5a4ebd3a |
hex | 18b11a4991 |
106050505105 has 8 divisors (see below), whose sum is σ = 127289033064. Its totient is φ = 84821452800.
The previous prime is 106050505091. The next prime is 106050505109. The reversal of 106050505105 is 501505050601.
It can be written as a sum of positive squares in 4 ways, for example, as 29967764544 + 76082740561 = 173112^2 + 275831^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106050505105 - 215 = 106050472337 is a prime.
It is a super-2 number, since 2×1060505051052 (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 (106050505109) 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, 2344266 + ... + 2389075.
It is an arithmetic number, because the mean of its divisors is an integer number (15911129133).
Almost surely, 2106050505105 is an apocalyptic number.
It is an amenable number.
106050505105 is a deficient number, since it is larger than the sum of its proper divisors (21238527959).
106050505105 is an equidigital number, since it uses as much as digits as its factorization.
106050505105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4737827.
The product of its (nonzero) digits is 3750, while the sum is 28.
Adding to 106050505105 its reverse (501505050601), we get a palindrome (607555555706).
The spelling of 106050505105 in words is "one hundred six billion, fifty million, five hundred five thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •