Properties of the Number 3085

Three Thousand Eighty-Five

Basics

Value: 3084 → 3085 → 3086

Parity: odd

Prime: No

Previous Prime: 3083

Next Prime: 3089

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 5 × 617

Divisors: 1, 5, 617, 3085

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110000001101

Octal: 6015

Duodecimal: 1951

Hexadecimal: c0d

Square: 9517225

Square Root: 55.54277630799526

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Number of Look-and-Say partitions of n; see Comments. A239455

Coordination sequence for 3D uniform tiling formed by stacking parallel layers of the 4.8.8 2D tiling (cf. A008576). A299259

Partial sums of sequence of odd primes (A065091); a(n) = sum of the first n odd primes. A71148

Numbers that are the sum of 10 positive 7th powers. A3377

Binary representation of base-(i-1) expansion of n: replace i-1 with 2 in base-(i-1) expansion of n. A66321

Number of maximal subsets of {1..n} such that every pair of distinct elements has a different quotient. A325861

T(n,k) is the number of n-bead necklaces labeled with numbers -k..k allowing reversal, with sum zero. A208825

Number of integer partitions of n with adjusted frequency depth 3. A325245

Number of maximal subsets of {1..n} containing n such that every pair of distinct elements has a different quotient. A325869

Composite squarefree numbers n such that p + τ(n) divides n - φ(n), where p are the prime factors of n, τ(n) = A000005(n) and φ(n) = A000010(n). A229324