5769
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 8346
- Proper Divisor Sum (Aliquot Sum)
- 2577
- 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
- 3840
- Möbius Function
- 0
- Radical
- 1923
- Omega Function (Ω)
- 3
- 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
- 173
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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 degree-n permutations of order dividing 3.at n=9A001470
- Table T(n,k) giving number of permutations of [1..n] with order dividing k, read by antidiagonals.at n=57A008307
- Numbers k such that the continued fraction for sqrt(k) has period 96.at n=8A020435
- Numbers k such that Fibonacci(k) == 34 (mod k).at n=46A023180
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 46 ones.at n=14A031814
- Smaller of a pair of consecutive lucky numbers with a gap of 2n.at n=16A031884
- a(n) = floor ( n(n+1)(n+2)(n+3) / (n+(n+1)+(n+2)+(n+3)) ).at n=27A032767
- a(n) = A005248(n) - n.at n=9A033550
- Denominators of continued fraction convergents to sqrt(107).at n=8A041193
- Denominators of continued fraction convergents to sqrt(428).at n=8A041815
- The number phi_3(n) of Frobenius partitions that allow up to 3 repetitions of an integer in a row.at n=20A053992
- Composite n such that the sums of the composite numbers up to n, +/- 1, are twin primes.at n=35A065022
- Number of (unordered) ways of making change for n cents using coins of 1/2, 1, 2, 3, 5, 10, 20, 25, 50, 100 cents (all historical U.S.A. coinage denominations up to 100 cents).at n=35A067997
- Number of A095746-primes in range ]2^n,2^(n+1)].at n=17A095756
- a(n) = 3*(2*n^2 + 1).at n=31A097803
- a(n) is the sum of the (1,2)- and (1,3)-entries of the matrix P^n + T^n, where the 3 X 3 matrices P and T are defined by P = [0,1,0; 0,0,1; 1,0,0] and T = [0,1,0; 0,0,1; 1,1,1].at n=16A109523
- Numbers k such that k + sigma(k) + phi(k) is a triangular number.at n=32A115906
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (-1, 0, 1), (0, 1, -1), (1, 0, 0)}.at n=9A148561
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (-1, 1, -1), (0, -1, 1), (1, 1, 0)}.at n=8A149174
- Number of crossings in a regular drawing of the complete bipartite graph K(n,n).at n=14A159065