5552
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 10788
- Proper Divisor Sum (Aliquot Sum)
- 5236
- 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
- 2768
- Möbius Function
- 0
- Radical
- 694
- Omega Function (Ω)
- 5
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 129
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) is the smallest positive number such that the sum of A001032(n) consecutive squares starting with a(n)^2 is a square.at n=19A007475
- Coordination sequence T1 for Zeolite Code TON.at n=46A008241
- a(n) = least m such that if r and s in {1/1, 1/4, 1/7, ..., 1/(3n-2)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=33A024836
- One half of convolution of central binomial coefficients A000984(n) with A000984(n+2), n >= 0.at n=5A038602
- Numbers having three 5's in base 10.at n=17A043511
- Number of partitions of n with equal number of parts congruent to each of 0, 2 and 3 (mod 4).at n=51A046768
- Number of Greek-key tours on a 3 X n board; i.e., self-avoiding walks on a 3 X n grid starting in the top left corner.at n=11A046994
- a(n) contains n digits (either '2' or '5') and is divisible by 2^n.at n=3A053317
- Open 3-dimensional ball numbers (version 3): a(n) is the number of integer points (i,j,k) contained in an open ball of diameter n, centered at (1/2,1/2,0).at n=22A053595
- Smallest m such that A065623(m) = n.at n=16A065624
- Numbers using only the digits 2 and 5, that are both curved and straight.at n=28A072961
- Expansion of 1/(1+2*x^2-x^3).at n=22A077965
- Expansion of 1/(1+2*x^2+x^3).at n=22A077967
- Leading term of n-th row of A081491.at n=26A081490
- Triangle read by rows: T(n, k) = number of permutations <p(1), p(2), ..., p(n)> of <1, 2, ..., n> that end with k, such that p(k) > p(k-1) when k is composite and p(k) < p(k-1) when k is prime. (n > 0, 1 <= k <= n).at n=62A097278
- A Chebyshev transform of the Padovan numbers.at n=37A100049
- a(n) = 3*n^2 + 6*n + 8.at n=42A106648
- n^2 * (n^3 + 2n^2 + 7n - 2) / 8.at n=8A106845
- Triangle read by rows T(n,k) = the number of Dyck paths of semilength n with k UUDDU's, 0<=k<=[(n-1)/2].at n=40A114848
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having height of the first peak equal to k (1 <= k <= n).at n=51A128744