10460
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 22008
- Proper Divisor Sum (Aliquot Sum)
- 11548
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4176
- Möbius Function
- 0
- Radical
- 5230
- 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
- 179
- 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 parts in all partitions of n into distinct parts.at n=44A015723
- Multiplicity of highest weight (or singular) vectors associated with character chi_9 of Monster module.at n=41A034397
- Exponents in expansion of constant A065463 as Product_{n>1} zeta(n)^(-a(n)).at n=25A065490
- Number of difference sets of subsets of {1,2,...,n}, i.e., the size of {D(A) : A subset [n] }, where D(A)={a_i-a_j : a_i>a_j and a_i,a_j in A}.at n=19A067247
- a(n) = a(n-1) + Sum_{k=0..floor(log_2(n-1))} a(2^k), a(1) = 1.at n=31A133147
- Numbers k such that k and k^2 use only the digits 0, 1, 4, 6 and 9.at n=24A136862
- a(n) has generating function 1/((1-x)^k*(1-x^2)^(k*(k-1)/2)) for k=5.at n=8A181477
- a(n,k) equals the number of semistandard Young tableaux with shape of a partition of n and maximal element <= k.at n=32A191714
- Number of 2 X 2 matrices having all elements in {-n,...n} and determinant 2.at n=26A209984
- Number of 2 X 2 matrices with all elements in {1,2,...,n} and determinant in {-1,0,1}.at n=40A209994
- Number of semistandard Young tableaux over all partitions of 8 with maximal element <= n.at n=5A210430
- Number of length n+1 0..7 arrays with the sum of adjacent differences multiplied by some arrangement of +-1 equal to zero.at n=3A250166
- T(n,k)=Number of length n+1 0..k arrays with the sum of adjacent differences multiplied by some arrangement of +-1 equal to zero.at n=48A250167
- Number of length 4+1 0..n arrays with the sum of adjacent differences multiplied by some arrangement of +-1 equal to zero.at n=6A250169
- Expansion of Product_{k>=1} (1 + x^prime(k))^prime(k).at n=28A291647
- Numbers k such that 3*10^k - 31 is prime.at n=16A293842
- Partial sums of A294629.at n=21A294630
- Array read by antidiagonals: A(n,k) is the number of nonnegative integer matrices with k columns and any number of distinct nonzero rows with column sums n and columns in nonincreasing lexicographic order.at n=30A331572
- Number of nonnegative integer matrices with n columns and any number of distinct nonzero rows with column sums 2 and columns in nonincreasing lexicographic order.at n=5A331709
- Positions of -4's in A346242.at n=45A372564