Base | Representation |
---|---|
bin | 1100101110011… |
… | …11010000011101 |
3 | 21102212201110122 |
4 | 12113033100131 |
5 | 204312130401 |
6 | 14332044325 |
7 | 2434255235 |
oct | 627172035 |
9 | 242781418 |
10 | 106755101 |
11 | 55295762 |
12 | 2b9036a5 |
13 | 1916a3cb |
14 | 1026ccc5 |
15 | 958b21b |
hex | 65cf41d |
106755101 has 4 divisors (see below), whose sum is σ = 109640412. Its totient is φ = 103869792.
The previous prime is 106755097. The next prime is 106755107. The reversal of 106755101 is 101557601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 101557601 = 1429 ⋅71069.
It can be written as a sum of positive squares in 2 ways, for example, as 86007076 + 20748025 = 9274^2 + 4555^2 .
It is a cyclic number.
It is not a de Polignac number, because 106755101 - 22 = 106755097 is a prime.
It is a super-2 number, since 2×1067551012 = 22793303179040402, which 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 (106755107) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1442600 + ... + 1442673.
It is an arithmetic number, because the mean of its divisors is an integer number (27410103).
Almost surely, 2106755101 is an apocalyptic number.
It is an amenable number.
106755101 is a deficient number, since it is larger than the sum of its proper divisors (2885311).
106755101 is an equidigital number, since it uses as much as digits as its factorization.
106755101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2885310.
The product of its (nonzero) digits is 1050, while the sum is 26.
The square root of 106755101 is about 10332.2360116288. The cubic root of 106755101 is about 474.3834675151.
The spelling of 106755101 in words is "one hundred six million, seven hundred fifty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •