Base | Representation |
---|---|
bin | 1100101010010… |
… | …11111001111101 |
3 | 21101212101110010 |
4 | 12111023321331 |
5 | 204142421320 |
6 | 14312333433 |
7 | 2426554542 |
oct | 625137175 |
9 | 241771403 |
10 | 106217085 |
11 | 54a58517 |
12 | 2b6a4279 |
13 | 1900c560 |
14 | 1016cbc9 |
15 | 94d1ae0 |
hex | 654be7d |
106217085 has 32 divisors (see below), whose sum is σ = 184504320. Its totient is φ = 51867648.
The previous prime is 106217077. The next prime is 106217093. The reversal of 106217085 is 580712601.
It is an interprime number because it is at equal distance from previous prime (106217077) and next prime (106217093).
It is not a de Polignac number, because 106217085 - 23 = 106217077 is a prime.
It is a super-2 number, since 2×1062170852 = 22564138291794450, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 22621 + ... + 26909.
It is an arithmetic number, because the mean of its divisors is an integer number (5765760).
Almost surely, 2106217085 is an apocalyptic number.
106217085 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106217085 is a deficient number, since it is larger than the sum of its proper divisors (78287235).
106217085 is a wasteful number, since it uses less digits than its factorization.
106217085 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4437.
The product of its (nonzero) digits is 3360, while the sum is 30.
The square root of 106217085 is about 10306.1673283525. The cubic root of 106217085 is about 473.5852047824.
Adding to 106217085 its reverse (580712601), we get a palindrome (686929686).
The spelling of 106217085 in words is "one hundred six million, two hundred seventeen thousand, eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •