5772
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 14896
- Proper Divisor Sum (Aliquot Sum)
- 9124
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1728
- Möbius Function
- 0
- Radical
- 2886
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 49
- Smith Number
- yes
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = ceiling(n*phi^11), where phi is the golden ratio, A001622.at n=29A004966
- An upper bound on the biplanar crossing number of the complete graph on n nodes.at n=36A007333
- Coordination sequence T2 for Milarite.at n=47A008257
- Molien series of 4-dimensional representation of u.g.g.r. #8.at n=23A013978
- From George Gilbert's marks problem: jumping 3 marks at a time (initial positions).at n=18A019592
- Sum of digits in n-th term of A022482.at n=26A022487
- [ 3rd elementary symmetric function of {sqrt(k+1)} ], k = 1,2,...,n.at n=10A025220
- a(n) = n*(n + 1)*(3*n + 1).at n=12A027903
- Eighth column (m=7) of convolution triangle A059594(n,m).at n=6A059596
- Multiples of 6 with only prime digits (2, 3, 5 and 7).at n=22A077535
- G.f. = { 1+sum(4*n*q^n, n=1..infinity)} / { theta series for square lattice }.at n=16A079902
- a(n) = running sum of the first n harmonic numbers, multiplied by the LCM of 1..n.at n=6A081530
- Duplicate of A081530.at n=6A081886
- Numbers k such that 11*13^k + 2 is prime.at n=14A084074
- Symmetric square array, read by antidiagonals, such that the inverse binomial transform of row n forms the sequence: {C(n,k)*A101514(k), 0<=k<=n}, where A101514 equals the main diagonal shift right.at n=71A101515
- Symmetric square array, read by antidiagonals, such that the inverse binomial transform of row n forms the sequence: {C(n,k)*A101514(k), 0<=k<=n}, where A101514 equals the main diagonal shift right.at n=72A101515
- A110404(k)/k where k is the corresponding number == 1,3,7 or 9 (mod 10).at n=8A110405
- Triangle read by rows: T(n,k) is the number of hill-free Schroeder paths of length 2n that have k horizontal steps on the x-axis (0<=k<=n). A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis. A hill is a peak at height 1.at n=37A114709
- Smallest term in the Hofstadter sequence A005243 having exactly n representations as sum of consecutive earlier terms.at n=11A118166
- Number of bridged bicyclic skeletons with n carbon atoms (see Parks et al. for precise definition).at n=9A121328