9752
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 19440
- Proper Divisor Sum (Aliquot Sum)
- 9688
- 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
- 4576
- Möbius Function
- 0
- Radical
- 2438
- Omega Function (Ω)
- 5
- 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
- 135
- 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
- Number of bracelets (turn over necklaces) with n red, 1 pink and n - 3 blue beads; also reversible strings with n red and n-3 blue beads.at n=9A005656
- If a, b in sequence, so is ab+8.at n=37A009331
- a(n) = floor( n*(n-1)*(n-2)/20 ).at n=59A011902
- Alkane (or paraffin) numbers l(10,n).at n=10A018211
- Alkane (or paraffin) numbers l(13,n).at n=7A018214
- a(n) = 2*(n+1) + 3*n + ... + (k+1)*(n+2-k), where k = floor((n+1)/2).at n=45A024305
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k=[ (n+1)/2 ], s = (natural numbers >= 2), t = (natural numbers >= 3).at n=44A024306
- a(n) = 2*(n+1) + 3*n + ... + (k+1)*(n+2-k), where k = floor(n/2).at n=44A024868
- (d(n)-r(n))/2, where d = A008778 and r is the periodic sequence with fundamental period (1,1,0,1).at n=45A026052
- Dirichlet convolution of Catalan numbers with themselves.at n=9A034768
- Expansion of e.g.f. exp(2*x)/(1-x)^3.at n=5A082031
- n times n+8 gives the concatenation of two numbers m and m+3.at n=3A116312
- Ramanujan numbers (A000594) read mod 23^3.at n=31A126847
- Numbers k such that A(k+1) = A(k) + 1, where A() = A005101() are the abundant numbers.at n=8A169822
- The numbers n in s=n^2 + (n+1)^2 that satisfy the requirement for two consecutive squares c,d with c<d with d-c being the sum of two consecutive squares that c<s<d will give s-c and d-s both being squares.at n=16A192743
- Number of (n+1) X (2+1) 0..2 arrays colored with the upper median value of each 2 X 2 subblock.at n=5A235948
- Number of (n+1) X (6+1) 0..2 arrays colored with the upper median value of each 2 X 2 subblock.at n=1A235952
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the upper median value of each 2X2 subblock.at n=22A235954
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the upper median value of each 2X2 subblock.at n=26A235954
- Number of partitions of n not containing 2*(number of parts) as a part.at n=32A238488