10486
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 18468
- Proper Divisor Sum (Aliquot Sum)
- 7982
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4452
- Möbius Function
- 0
- Radical
- 1498
- 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
- yes
- Odd
- no
Appears in sequences
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 25.at n=18A068043
- a(n) = (n times concatenation of n - n^n) divided by n, or a(n) = A083451(n) /n.at n=4A083452
- Spt function: total number of smallest parts (counted with multiplicity) in all partitions of n.at n=25A092269
- Eigensequence of A061554 regarded as a triangle: a(n) = Sum_{k=0..n-1} A061554(n-1,k)*a(k) with a(0)=1.at n=10A125094
- Number of base 20 n-digit numbers with adjacent digits differing by two or less.at n=5A126407
- Number of nondecreasing arrangements of n+3 numbers in 0..3 with each number being the sum mod 4 of three others.at n=34A183898
- Fourth accumulation array, T, of the natural number array A000027, by antidiagonals.at n=32A185509
- spt(7n+5) where spt(n) = A092269(n).at n=3A220502
- Number of (n+1)X(1+1) 0..1 arrays x(i,j) with row sums sum{j^3*x(i,j), j=1..1+1} nondecreasing, and column sums sum{i^3*x(i,j), i=1..n+1} nondecreasing.at n=40A232854
- Number of partitions p of n such that if h = min(p), then h is an (h,0)-separator of p; see Comments.at n=48A239510
- Number of partitions p of n such that (maximal multiplicity of the parts of p) > (maximal part of p).at n=43A240314
- Number of partitions of n with difference -5 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=40A242687
- Number of (n+2)X(3+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 2 5 6 or 7.at n=3A252214
- Number of (n+2)X(4+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 2 5 6 or 7.at n=2A252215
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 2 5 6 or 7.at n=17A252219
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 2 5 6 or 7.at n=18A252219
- Number of regular tetrahedra in an n-node-per-edge tetrahedral grid.at n=18A269747
- Number of partitions of n for which the number of even parts is equal to the positive alternating sum of the parts.at n=48A277579
- Expansion of Sum_{i>=1} x^(i*(i+1)/2)/(1 - x^(i*(i+1)/2)) / Product_{j>=1} (1 - x^(j*(j+1)/2)).at n=53A281615
- Triangle of coefficients of polynomials p_n(x) (exponents in increasing order) where 2^(x-n-1)p_n(x)/n! counts the ways a game of Nim with two piles of sizes x and n can be played out (x > 0, n >= 0).at n=33A289329