Base | Representation |
---|---|
bin | 1100101010000… |
… | …00011011110110 |
3 | 21101210000000000 |
4 | 12111000123312 |
5 | 204134420402 |
6 | 14311332130 |
7 | 2426300553 |
oct | 625003366 |
9 | 241700000 |
10 | 106170102 |
11 | 54a26195 |
12 | 2b681046 |
13 | 18cc405c |
14 | 10159a2a |
15 | 94c2c1c |
hex | 65406f6 |
106170102 has 88 divisors (see below), whose sum is σ = 255090240. Its totient is φ = 33067440.
The previous prime is 106170101. The next prime is 106170109. The reversal of 106170102 is 201071601.
It is a super-2 number, since 2×1061701022 = 22544181117380808, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106170101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 43 ways as a sum of consecutive naturals, for example, 3424827 + ... + 3424857.
Almost surely, 2106170102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106170102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (127545120).
106170102 is an abundant number, since it is smaller than the sum of its proper divisors (148920138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106170102 is an frugal number, since it uses more digits than its factorization.
106170102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92 (or 65 counting only the distinct ones).
The product of its (nonzero) digits is 84, while the sum is 18.
The square root of 106170102 is about 10303.8877128975. The cubic root of 106170102 is about 473.5153675079.
The spelling of 106170102 in words is "one hundred six million, one hundred seventy thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •