Base | Representation |
---|---|
bin | 1100101110010… |
… | …01100010110111 |
3 | 21102211112101001 |
4 | 12113021202313 |
5 | 204310403303 |
6 | 14331344131 |
7 | 2434130101 |
oct | 627114267 |
9 | 242745331 |
10 | 106731703 |
11 | 5527a121 |
12 | 2b8b2047 |
13 | 1915c870 |
14 | 10264571 |
15 | 958431d |
hex | 65c98b7 |
106731703 has 4 divisors (see below), whose sum is σ = 114941848. Its totient is φ = 98521560.
The previous prime is 106731679. The next prime is 106731739. The reversal of 106731703 is 307137601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 307137601 = 41 ⋅7491161.
It is a cyclic number.
It is not a de Polignac number, because 106731703 - 25 = 106731671 is a prime.
It is a super-4 number, since 4×1067317034 (a number of 33 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106731773) 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, 4105053 + ... + 4105078.
It is an arithmetic number, because the mean of its divisors is an integer number (28735462).
Almost surely, 2106731703 is an apocalyptic number.
106731703 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
106731703 is a deficient number, since it is larger than the sum of its proper divisors (8210145).
106731703 is an equidigital number, since it uses as much as digits as its factorization.
106731703 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8210144.
The product of its (nonzero) digits is 2646, while the sum is 28.
The square root of 106731703 is about 10331.1036680502. The cubic root of 106731703 is about 474.3488073903.
The spelling of 106731703 in words is "one hundred six million, seven hundred thirty-one thousand, seven hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •