16210
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
- 8
- Divisor Sum
- 29196
- Proper Divisor Sum (Aliquot Sum)
- 12986
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6480
- Möbius Function
- -1
- Radical
- 16210
- Omega Function (Ω)
- 3
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 71
- 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
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 28.at n=1A031616
- Triangle read by rows: reversed partial sums of Narayana triangle rows.at n=48A104710
- Negative numbers written in a bits-of-Pi/primorial base system.at n=19A109839
- a(1)=1; for n>1, a(n) = a(n-1) + n^0 if n odd, a(n) = a(n-1) + n^3 if n is even.at n=18A135332
- Convolution square of A003114.at n=37A145467
- 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, 0, 0), (0, -1, 1), (0, 1, 0), (1, 0, -1), (1, 0, 0)}.at n=8A150100
- Maximal length of rook tour on an n X n+4 board.at n=26A152135
- a(0)=4; a(n)=n^2+a(n-1) for n>0.at n=36A153058
- Least number m such that floor((3^n-m)/(2^n-m)) > floor(3^n/2^n).at n=36A153725
- Positions of 3's in A234323.at n=31A234804
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 737", based on the 5-celled von Neumann neighborhood.at n=22A273480
- p-INVERT of (0,1,0,1,0,1,...), where p(S) = (1 - S^3)^2.at n=20A291240
- Number of ways to select 4 numbers from the set of the first n natural numbers avoiding 3-term arithmetic progressions.at n=24A300760
- Partial sums of the Dedekind psi_2(k) function, for 1 <= k <= n.at n=34A321973
- E.g.f.: Sum_{n>=0} (n+1) * x^n * (exp(n*x) + 1)^n / (1 + x*exp(n*x))^(n+2).at n=5A325995
- Numbers of graphs which are double triangle descendants of K_5 with four more vertices than triangles.at n=31A332735
- Records in A338338.at n=50A338348
- Number of partitions of set [n] in a set of <= k noncrossing subsets. Number of Dyck n-paths with at most k peaks. Both with 0 <= k <= n, read by rows.at n=62A349740
- Consecutive internal states of the linear congruential pseudo-random number generator (281*s + 28411) mod 134456 when started at 1.at n=19A383126
- a(n) = Sum_{k=0..n} (-1)^k * (3*k+1) * binomial(4*n-k+1,n-k)/(4*n-k+1).at n=7A390500