10360
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 27360
- Proper Divisor Sum (Aliquot Sum)
- 17000
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3456
- Möbius Function
- 0
- Radical
- 2590
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 42
- 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
- Second elementary symmetric function of 3,4,...,n+3.at n=13A024183
- a(n) = position of n^3 + (n+1)^3 + (n+2)^3 in A024975.at n=31A024980
- Number of possible queen moves on an n X n chessboard.at n=14A035005
- Number of labeled pure 2-complexes on n nodes (0-simplexes) with 5 2-simplexes and 9 1-simplexes.at n=3A054558
- a(n) = Sum_{i=1..n} Sum_{j=1..i} (prime(i) - prime(j)).at n=24A062020
- Add column entries of the table with rows (1,2,0,0...), (0,3,4,5,0,0...), (0,0,6,7,8,9,0,0...), (0,0,0,10,11,12,13,14,0,0...), ...at n=39A064694
- Number of (binary) bit strings of length n having at least one even length block of 0's followed by an even length block of 1's.at n=15A065497
- Numbers n which are a proper multiple (>1) of A068505(n) (= n read in base m+1 where m = largest digit of n).at n=27A089584
- Triangle read by rows: T(n,m) = number of T_0-multigraphs with n edges and m vertices(n>=2, 3<=m<=2*n).at n=32A093855
- Lower triangular matrix T, read by rows, such that T(n,0) = 1 and T(n,k) = T(n-1,k) + T^2(n-1,k-1) for k>0, where T^2 is the matrix square of T.at n=29A097712
- Column 1 of triangle A097712.at n=6A097713
- Triangle read by rows: T2[n,k] = Sum_{partitions of n with k parts p(n, k; m_1, m_2, m_3, ..., m_n)} c(n; m_1, m_2, ..., m_n) * x_1^m_1 * x_2^m_2 * ... x^n*m_n, where x_i = i-th prime.at n=25A145520
- A functionally symmetric Polynomial as a triangle of coefficients: p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 4)*Sum[(2^m + 2*m + 2)*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=58A146954
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 1), (0, 1, -1), (1, -1, 1), (1, 0, 1)}.at n=8A149044
- a(n) = 343*n - 273.at n=30A157369
- a(n) = ((3+sqrt(2))*(4+sqrt(2))^n + (3-sqrt(2))*(4-sqrt(2))^n)/2.at n=5A161939
- Number of nondecreasing arrangements of 10 numbers in 0..n with the last equal to n and each after the second equal to the sum of one or two of the preceding four.at n=32A189333
- Irregular triangular array read by rows T(n,k) is the number of 2-colored labeled graphs that have exactly k edges, n >= 2, 0 <= k <= A033638(n).at n=30A201143
- Expansion of g.f. -(1+x)*(1+sqrt(1-4*x))/(2*(1-x-x^2)).at n=10A201164
- G.f. satisfies: A(x) = exp( Sum_{n>=1} (A(x) - (-1)^n)^n * x^n/n ).at n=8A202668