10468
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
- 6
- Divisor Sum
- 18326
- Proper Divisor Sum (Aliquot Sum)
- 7858
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5232
- Möbius Function
- 0
- Radical
- 5234
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- 86
- 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 red-black rooted trees with n-1 internal nodes.at n=16A001131
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/29 ).at n=25A011939
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 44 ones.at n=41A031812
- Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(n+1,0)=A006319(n)=a(n,0) + Sum a(k,k), k=0..n-1. a(n,m+1)= a(n,0) + Sum A006319(k)*a(n-k-1,0), k=0..m-1.at n=31A073151
- Inverse binomial transform of A053088.at n=12A084219
- Expansion of f(x^3)/(1-x*f(x^3)), where f(x) is the g.f. of A001764, whose n-th term is binomial(3n,n)/(2n+1).at n=19A126042
- Sequence s_n arising in enumeration of arrays of directed blocks (see Quaintance reference for precise definition).at n=11A129873
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (-1, 1), (0, -1), (0, 1), (1, 1)}.at n=8A151436
- a(n) = 361*n - 1.at n=28A158308
- Triangle T(n,k), 0<=k<=n, read by rows given by [1,1,2,1,2,1,2,1,2,1,2,...] DELTA [1,1,0,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938.at n=31A167656
- Number of rhombuses on a (n+1)X8 grid.at n=39A190096
- Numbers n such that d(n-1) = d(n+1) = 6, where d(k) is the number of divisors of k (A000005).at n=38A190267
- G.f.: Sum_{n>=0} x^n * (1+x)^sigma(n).at n=14A227236
- Number of (6+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=8A250774
- Partial sums of A072272.at n=59A253908
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 806", based on the 5-celled von Neumann neighborhood.at n=35A273608
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 865", based on the 5-celled von Neumann neighborhood.at n=20A273701
- a(n) is the sum of the base-b representations of n for 2 <= b <= n+1 read in base ten.at n=17A289335
- Number of permutations of length n sortable by 4 passes through a pop-stack.at n=8A293775
- Numbers whose digits are distinct nonprimes and are not a permutation of a smaller such number.at n=56A359982