5292
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- yes
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 15960
- Proper Divisor Sum (Aliquot Sum)
- 10668
- 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
- 1512
- Möbius Function
- 0
- Radical
- 42
- Omega Function (Ω)
- 7
- Little Omega Function (ω)
- 3
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 54
- 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
- yes
- Achilles Number
- yes
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan triangle.at n=50A001263
- Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan triangle.at n=49A001263
- Tetrahedral numbers written backwards.at n=25A004161
- a(n) = n^2*(n+1)*(n+2)^2/6.at n=7A004256
- a(n) is the number of n-step walks on square lattice such that 0 <= y <= x at each step.at n=9A005558
- Number of points on surface of cuboctahedron (or icosahedron): a(0) = 1; for n > 0, a(n) = 10n^2 + 2. Also coordination sequence for f.c.c. or A_3 or D_3 lattice.at n=23A005901
- a(n) = binomial(n+5,5) * binomial(n+5,4)/(n+5).at n=5A006857
- Kaprekar numbers: positive numbers n such that n = q+r and n^2 = q*10^m+r, for some m >= 1, q >= 0 and 0 <= r < 10^m, with n != 10^a, a >= 1.at n=13A006886
- Coordination sequence for diamond.at n=46A008253
- a(n) = (2*n - 1)*n^2.at n=14A015237
- Expansion of x/(1 - 4*x - 11*x^2).at n=6A015534
- Numbers k such that k | (phi(k) * sigma(k)) but (phi(k) + sigma(k))/k does not increase.at n=40A015708
- Numbers n such that n is a substring of its square in base 5 (written in base 10).at n=13A018829
- Place n distinguishable balls in n boxes (in n^n ways); let T(n,k) = number of ways that the maximum in any box is k, for 1 <= k <= n; sequence gives triangle of numbers T(n,k).at n=25A019575
- Numbers whose base-5 representation is the juxtaposition of two identical strings.at n=41A020333
- Second diagonal of A027446.at n=9A027449
- a(n)/1000 gives sqrt(n) to 3 places after the decimal point.at n=27A027662
- Theta series of 6-dimensional lattice P6.4 = A6,2.at n=34A029690
- a(n) = 3*n^2.at n=42A033428
- Second 10-gonal (or decagonal) numbers: n*(4*n+3).at n=36A033954