10437
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 16416
- Proper Divisor Sum (Aliquot Sum)
- 5979
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5880
- Möbius Function
- 0
- Radical
- 1491
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 55
- 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
- no
- Odd
- yes
Appears in sequences
- Expansion of x^3*(5-2*x)*(1-x^3)/(1-x)^4.at n=47A000338
- Quadruples of different integers from [ 1,n ] with no common factors between pairs.at n=38A015623
- Numbers k such that sigma(k) = sigma(k+5).at n=6A015865
- Number of ways to color edges of a tetrahedron using <= n colors.at n=7A046023
- Numbers k such that x^k + x^2 + 1 is irreducible over GF(2).at n=12A057460
- a(n) = smallest k such that the Reverse and Add! trajectory of A063048(n) joins the trajectory of k.at n=27A089493
- Numbers such that both their binary and Zeckendorf representations are palindromic.at n=10A095309
- Least positive multiple of 2n-1 which is palindromic in base 2.at n=35A141708
- a(n) = (2*n^3 + 5*n^2 + 7*n)/2.at n=20A162264
- Triangle T(n,k), n>=1, 0<=k<=n^2, read by rows: row n gives the coefficients of the chromatic polynomial of the square grid graph G_(n,n), highest powers first.at n=21A182368
- Numbers that match polynomials over {0,1} that have a factor containing 3 as a coefficient; see Comments.at n=23A208181
- Numbers that match polynomials over {0,1} that have a factor containing -3 as a coefficient; see Comments.at n=6A208182
- Power floor sequence of sqrt(5).at n=11A214999
- Number of partitions p of n such that 2(number of parts of p) - min(p) is a part of p.at n=51A238587
- Number of balanced ternary words of length n.at n=21A260938
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 427", based on the 5-celled von Neumann neighborhood.at n=23A271904
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 870", based on the 5-celled von Neumann neighborhood.at n=32A273705
- a(n) = 27*n^2/2 + 45*n/2 - 12 (n>=1).at n=26A304375
- Number of separable partitions of n in which the number of distinct (repeatable) parts is 4.at n=43A325648
- Array read by descending antidiagonals: A(n,k) is the number of oriented colorings of the edges of a regular n-dimensional simplex using up to k colors.at n=38A327083