10670
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 21168
- Proper Divisor Sum (Aliquot Sum)
- 10498
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3840
- Möbius Function
- 1
- Radical
- 10670
- Omega Function (Ω)
- 4
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 47
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- G.f.: Product_{k>=1} (1 + x^(2*k - 1)) / (1 - x^(2*k)).at n=45A006950
- a(n) = n*(11*n+1)/2.at n=44A022269
- Positive numbers k such that k and 7*k are anagrams in base 8 (written in base 8).at n=3A023078
- Expansion of 1/((1-3x)(1-5x)(1-11x)(1-12x)).at n=3A028073
- a(n) = n^3 + n.at n=22A034262
- Numbers having four 2's in base 6.at n=28A043380
- a(n) = n*(n^2 + 1) if n is even, otherwise (n - 1/2)*(n^2 + 1).at n=22A071289
- a(n) = Sum_{d divides n} d^(n/d + 1).at n=19A078308
- a(n) = A026905(n) - A014284(n).at n=25A086741
- Expansion of x*(1 + x + x^2)/(1 - 2*x + x^5).at n=14A089074
- Number of partitions of [n] avoiding the pattern 12/34.at n=9A113485
- 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, 0), (0, 1, 1), (1, 0, -1)}.at n=8A149954
- a(n) = 2662*n + 22.at n=3A157613
- a(n) = n + [n^2 if n is odd or n^3 if n is even].at n=21A181427
- Number of (n+2) X 9 0..1 matrices with each 3 X 3 subblock idempotent.at n=12A224558
- Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.at n=17A225471
- Bisection of A006950 (the odd part).at n=22A233759
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 30", based on the 5-celled von Neumann neighborhood.at n=31A269755
- Expansion of 1/(1 - Sum_{k>=0} x^((2*k+1)^2)).at n=52A280863
- Number of compositions of n whose run-lengths are either strictly increasing or strictly decreasing.at n=37A333191