8946
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
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 22464
- Proper Divisor Sum (Aliquot Sum)
- 13518
- 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
- 2520
- Möbius Function
- 0
- Radical
- 2982
- 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
- 96
- 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 one-sided 4-dimensional polyominoes with n cells.at n=7A006760
- a(n) = Sum_{ d >= 1, d divides n} (-1)^(n-d)*d^3.at n=19A008457
- Number of partitions of n into at most 7 parts.at n=43A008636
- Expansion of e.g.f. cos(tan(log(1+x))).at n=7A009065
- Number of strong restricted edge-subgraphs in Moebius ladder M_n.at n=4A020881
- Expansion of Product_{m>=1} (1-m*q^m)^21.at n=5A022681
- Triangle T(n,k) read by rows, arising in enumeration of catafusenes.at n=59A024462
- Number of partitions of n in which the greatest part is 7.at n=50A026813
- Starting from generation 6 add previous and next term yielding generation 7.at n=33A048453
- Triangle associated with rooted trees with a degree constraint (A036765).at n=63A064580
- Least positive integer multiples of angle x such that their direction cosines form a unit vector: Sum_{k>0} cos(a(k)*x)^2 = 1, where a(1)=1, a(n+1)>a(n) and x=5/4.at n=43A080198
- Triangle T(n,k), read by rows, given by [0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, ...] DELTA [1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, ...] where DELTA is the operator defined in A084938.at n=33A089949
- G.f.: Product((1+x^i)/(1-x^i),i=1..n-1)/(1-x^n), with n = 5.at n=33A091773
- Array read by antidiagonals: T(n,k) = number of rooted 2-dimensional polyominoes with k cells, the cells being regular n-gons, with no symmetries removed.at n=50A094166
- Number of rooted 2-dimensional polyominoes with n heptagonal cells, with no symmetries removed.at n=5A094168
- Numbers k such that 10^k + 4*R_k + 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=22A102934
- Triangle T(n,k), 0<=k<=n, read by rows, given by [0, 2, 1, 3, 2, 4, 3, 5, 4, 6, 5, 7, 6, ...] DELTA [1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, ...] where DELTA is the operator defined in A084938.at n=31A111184
- Numbers k such that k + sigma(k) + phi(k) is a triangular number.at n=42A115906
- a(n) = 5*n^2 + 3*n.at n=41A126264
- a(n) = 729*n - 531.at n=12A156771