Base | Representation |
---|---|
bin | 1100101001011… |
… | …11101101100111 |
3 | 21101122112001011 |
4 | 12110233231213 |
5 | 204130222412 |
6 | 14310043051 |
7 | 2425564063 |
oct | 624575547 |
9 | 241575034 |
10 | 106101607 |
11 | 54989787 |
12 | 2b649487 |
13 | 18c9bb21 |
14 | 1013caa3 |
15 | 94ac7a7 |
hex | 652fb67 |
106101607 has 24 divisors (see below), whose sum is σ = 119133504. Its totient is φ = 94113792.
The previous prime is 106101577. The next prime is 106101629. The reversal of 106101607 is 706101601.
It is a de Polignac number, because none of the positive numbers 2k-106101607 is a prime.
It is a super-3 number, since 3×1061016073 (a number of 25 digits) contains 333 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 (106101637) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1093783 + ... + 1093879.
It is an arithmetic number, because the mean of its divisors is an integer number (4963896).
Almost surely, 2106101607 is an apocalyptic number.
106101607 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
106101607 is a deficient number, since it is larger than the sum of its proper divisors (13031897).
106101607 is an equidigital number, since it uses as much as digits as its factorization.
106101607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235 (or 198 counting only the distinct ones).
The product of its (nonzero) digits is 252, while the sum is 22.
The square root of 106101607 is about 10300.5634311915. The cubic root of 106101607 is about 473.4135170756.
The spelling of 106101607 in words is "one hundred six million, one hundred one thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •