10236
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 23912
- Proper Divisor Sum (Aliquot Sum)
- 13676
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3408
- Möbius Function
- 0
- Radical
- 5118
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 117
- 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 graphs on n nodes with 3 cliques.at n=18A005289
- Theta series of direct sum of 2 copies of f.c.c. lattice.at n=16A008663
- Number of connected functions on n points with a loop of length 7.at n=8A029870
- Numbers with exactly five distinct base-10 digits.at n=2A031987
- a(n) = T(5,n), array T given by A047858.at n=10A047862
- a(n) = T(4,n), array T given by A048483.at n=11A048487
- Minimal positive solution z of Pell equation z^2 - A077426(n)*t^2 = -4.at n=42A078356
- Cumulative sum of absolute values of coefficients of q^(2n) in the series expansion of Ramanujan's mock theta function f(q).at n=31A109471
- Start with 1, then alternately add 2 or double.at n=22A123208
- Number of 9 X 9 arrays of squares of integers, symmetric under 90-degree rotation, with all rows summing to n.at n=8A156401
- Number of n X n arrays of squares of integers, symmetric under 90 degree rotation, with all rows summing to 8.at n=7A156447
- Partial sums of A200675.at n=44A200678
- Number of connected triangle-free graphs on n nodes with edge chromatic number 6.at n=10A207412
- a(n) is the total number of parts in the set of partitions of an n X n square lattice into squares, considering only the list of parts.at n=8A226897
- Expansion of g.f. 1/ (1-x^1*(1-x^(m+1))/ (1-x^2*(1-x^(m+2))/ (1- ... ))) for m=7.at n=19A228644
- Trisection of A107926: The least number k such that there are primes p and q with p - q = 6*n+2, p + q = k, and p the least such prime >= k/2.at n=26A234955
- a(n) is one fourth of the total number of free ends of 4 line segments expansion at n iterations (see Comments lines for definition).at n=22A238549
- Number of (n+2) X (4+2) 0..1 arrays with every 2 X 2 and 3 X 3 subblock diagonal maximum minus antidiagonal minimum nondecreasing horizontally and vertically.at n=6A253506
- Number of (n+2)X(7+2) 0..1 arrays with every 2X2 and 3X3 subblock diagonal maximum minus antidiagonal minimum nondecreasing horizontally and vertically.at n=3A253509
- a(n) = number of steps to reach 0 when starting from k = (n^3)-1 and repeatedly applying the map that replaces k with k - A055401(k), where A055401(k) = the number of positive cubes needed to sum to k using the greedy algorithm.at n=43A261228