4279
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4680
- Proper Divisor Sum (Aliquot Sum)
- 401
- 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
- 3880
- Möbius Function
- 1
- Radical
- 4279
- 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
- 77
- Smith Number
- yes
- 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
- Schroeder's second problem (generalized parentheses); also called super-Catalan numbers or little Schroeder numbers.at n=7A001003
- Table T(n,k), n>=0 and k>=0, read by antidiagonals: the k-th column given by the k-th Narayana polynomial.at n=47A008550
- Erroneous version of A001003.at n=7A010682
- Triangle of numbers S(x,y) = number of lattice paths from (0,0) to (x,y) that use step set { (0,1), (1,0), (2,0), (3,0), ....} and never pass below y = x.at n=35A011117
- Imaginary Rabbits: imaginary part of a(0)=i; a(1)=-i; a(n) = a(n-1) + i*a(n-2), with i = sqrt(-1).at n=26A014291
- Powers of cube root of 6 rounded down.at n=14A017991
- Powers of cube root of 6 rounded to nearest integer.at n=14A017992
- Powers of cube root of 23 rounded up.at n=8A018044
- Numbers k such that Fibonacci(k) == 89 (mod k).at n=45A023182
- Numbers with exactly five distinct base-8 digits.at n=15A031985
- "BFK" (reversible, size, unlabeled) transform of 2,1,1,1...at n=23A032044
- Trajectory of 3 under map n->15n+1 if n odd, n->n/2 if n even.at n=19A037105
- Numbers whose base-5 representation contains exactly three 1's and two 4's.at n=36A045261
- Starting positions of strings of 2 6's in the decimal expansion of Pi.at n=40A050245
- Number of nonnegative integer 2 X 2 matrices with no zero rows or columns and with sum of elements equal to n, up to row and column permutation.at n=43A054974
- Coordination sequence T1 for Zeolite Code SFE.at n=43A057317
- Number of covers of an unlabeled n-set such that every point of the set is covered by exactly 3 subsets of the cover and that intersection of every 3 subsets of the cover contains at most one point.at n=5A058790
- Number of self-conjugate three-quadrant Ferrers graphs that partition n.at n=43A059777
- Sum of the first n safe primes.at n=18A066869
- Trajectory of n under the Reverse and Add! operation carried out in base 4 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.at n=12A075421