ℕ atory
Play Now

Properties of the Number 4985

Four Thousand Nine Hundred Eighty-Five

Basics

Value: 4984 → 4985 → 4986

Parity: odd

Prime: No

Previous Prime: 4973

Next Prime: 4987

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 5 × 997

Divisors: 1, 5, 997, 4985

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001101111001

Octal: 11571

Duodecimal: 2A75

Hexadecimal: 1379

Square: 24850225

Square Root: 70.60453243241541

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

Expansion of ∏k>=1 (1+xk)p(k), where p(k) is the partition function. A261049
Position of first occurrence of exactly n consecutive '8's in a row in the decimal expansion of π. A96762
Number of compositions of n whose run-lengths are neither weakly increasing nor weakly decreasing. A332833
Triangle read by rows: T(n,k) is the number of unlabeled simple graphs on n vertices with independence number k. A263341
Triangle T, read by rows, that satisfies the recurrence: T(n,k) = [T5](n-1,k-1) + [T5](n-1,k) for n>k>=0, with T(n,n)=1 for n>=0, where T5 is the matrix 5th power of T. A113106
Number of 5-tournament sequences: a(n) gives the number of increasing sequences of n positive integers (t1,t2,...,tn) such that t1 = 1 and ti = 1 (mod 4) and ti+1 <= 5·ti for 1<i<n. A113107
Number of n-node simple graphs having clique number 4. A52452
Square table T, read by antidiagonals, where T(n,k) gives the number of n-th generation descendents of a node labeled (k) in the tree of 5-tournament sequences. A113103
"AFK" (ordered, size, unlabeled) transform of 2,1,1,1,... A32006
Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=0, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by the three-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees). A79219