4985
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5988
- Proper Divisor Sum (Aliquot Sum)
- 1003
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3984
- Möbius Function
- 1
- Radical
- 4985
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 116
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of ways in which n identical balls can be distributed among 6 boxes in a row such that each pair of adjacent boxes contains at least 4 balls.at n=6A005339
- Powers of fourth root of 3 rounded down.at n=31A018051
- Powers of fourth root of 3 rounded to nearest integer.at n=31A018052
- Numbers k such that the continued fraction for sqrt(k) has period 27.at n=18A020366
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 7.at n=12A031420
- "AFK" (ordered, size, unlabeled) transform of 2,1,1,1,...at n=21A032006
- a(n)=Sum{T(n,j): j=1,2,...,n}, array T given by A048201.at n=18A048209
- Starting positions of strings of 2 8's in the decimal expansion of Pi.at n=38A050263
- Number of n-node simple graphs having clique number 4.at n=7A052452
- 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).at n=66A079219
- Number of Catalan objects fixed by three-fold application of the Catalan bijections A057511/A057512 (Deep rotation of general parenthesizations/plane trees).at n=11A079224
- Starting positions of strings of three 8's in the decimal expansion of Pi.at n=2A083637
- Position of first occurrence of exactly n consecutive '8's in a row in the decimal expansion of Pi.at n=2A096762
- 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.at n=41A113103
- 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.at n=16A113103
- Triangle T, read by rows, that satisfies the recurrence: T(n,k) = [T^5](n-1,k-1) + [T^5](n-1,k) for n>k>=0, with T(n,n)=1 for n>=0, where T^5 is the matrix 5th power of T.at n=10A113106
- Number of 5-tournament sequences: a(n) gives the number of increasing sequences of n positive integers (t_1,t_2,...,t_n) such that t_1 = 1 and t_i = 1 (mod 4) and t_{i+1} <= 5*t_i for 1<i<n.at n=4A113107
- Triangle T, read by rows, equal to the matrix 5th power of triangle A113106, which satisfies the recurrence: A113106(n,k) = [A113106^5](n-1,k-1) + [A113106^5](n-1,k).at n=6A113114
- Triangle read by rows formed from nonzero entries in table of number of graphs on n nodes with clique number k.at n=25A115196
- Numbers n such that abs(7^n - 2^11) is prime.at n=19A122721