10485
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 18252
- Proper Divisor Sum (Aliquot Sum)
- 7767
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5568
- Möbius Function
- 0
- Radical
- 3495
- 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
- 148
- 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
- s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = (composite numbers).at n=33A025102
- Expansion of (1 + x)*(1 - x + x^2)/((1 - x)^4*(1 + x + x^2)).at n=44A070333
- Numbers m such that (15m-4, 15m-2, 15m+2, 15m+4) is a prime quadruple.at n=44A112540
- Size |S| of the largest subset S of {0,1}^n whose measure m(S) is <= 2^n, where m is the additive measure defined on each element x of S by m({x}) = 2^k(x), where k(x) is the number of non-null coordinates of x.at n=18A115993
- Number of partitions of n-set in which number of blocks of size 2k-1 is odd (or zero) for every k.at n=9A130223
- a(1) = 1, a(2) = 2; a(n) = a(n-a(1)) + a(n-a(2)) + a(n-a(3)) + a(n-a(4)) + ...at n=15A141435
- a(n) = numerator of the coefficient c(n) of x^n in sqrt(1+x)/Product_{k=1..n-1} 1 + c(k)*x^k, n = 1, 2, 3, ...at n=24A170922
- a(n) = numerator of the coefficient c(n) of x^n in (1/sqrt(1-x))/Product_{k=1..n-1} 1 + c(k)*x^k, n = 1, 2, 3, ...at n=24A170924
- a(n) = Sum_{k<=n} A000203(k)*(n-k+1), where A000203(m) is the sum of divisors of m.at n=32A175254
- Triangle, read by rows, T(n, k) = Sum_{j=0..k} (-1)^j*(k-j+1)^n*binomial(n+1, j) *binomial(n+2, j)/(j+1).at n=20A176124
- G.f. satisfies: A(x) = exp( Sum_{n>=1} [Sum_{k=0..3*n} binomial(3*n,k)^2 * x^k] / A(x)^n * x^n/n ).at n=9A255839
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 324", based on the 5-celled von Neumann neighborhood.at n=36A271257
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 601", based on the 5-celled von Neumann neighborhood.at n=21A272824
- Row 5 of A277710: Positions of 5's in A264977; positions of 10's in A277330.at n=28A277715
- Inverse binomial transform of the number of overpartitions (A015128).at n=20A294499
- Number of nX4 0..1 arrays with each 1 adjacent to 0, 3 or 5 king-move neighboring 1s.at n=5A296830
- Number of nX6 0..1 arrays with each 1 adjacent to 0, 3 or 5 king-move neighboring 1s.at n=3A296832
- T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 0, 3 or 5 king-move neighboring 1s.at n=39A296834
- T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 0, 3 or 5 king-move neighboring 1s.at n=41A296834
- a(n) is the greatest nonnegative number which has a partition into a triangular number (A000217), a square number (A000290), and a pentagonal number (A000326) in n different ways.at n=35A327792