Base | Representation |
---|---|
bin | 110001011101000011… |
… | …0110000110100011111 |
3 | 101011010100221201200212 |
4 | 1202322012300310133 |
5 | 3220000044100421 |
6 | 120442135443035 |
7 | 10446526165346 |
oct | 1427206606437 |
9 | 334110851625 |
10 | 106201550111 |
11 | 41049008528 |
12 | 186ba82647b |
13 | a026586217 |
14 | 51d6936b5d |
15 | 2b688d5e5b |
hex | 18ba1b0d1f |
106201550111 has 8 divisors (see below), whose sum is σ = 112358576880. Its totient is φ = 100101270528.
The previous prime is 106201550087. The next prime is 106201550129. The reversal of 106201550111 is 111055102601.
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 106201550111 - 26 = 106201550047 is a prime.
It is a super-2 number, since 2×1062015501112 (a number of 23 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 (106201550141) 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, 14182946 + ... + 14190431.
It is an arithmetic number, because the mean of its divisors is an integer number (14044822110).
Almost surely, 2106201550111 is an apocalyptic number.
106201550111 is a deficient number, since it is larger than the sum of its proper divisors (6157026769).
106201550111 is a wasteful number, since it uses less digits than its factorization.
106201550111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28373593.
The product of its (nonzero) digits is 300, while the sum is 23.
Adding to 106201550111 its reverse (111055102601), we get a palindrome (217256652712).
The spelling of 106201550111 in words is "one hundred six billion, two hundred one million, five hundred fifty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •