16283
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17160
- Proper Divisor Sum (Aliquot Sum)
- 877
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 15408
- Möbius Function
- 1
- Radical
- 16283
- Omega Function (Ω)
- 2
- 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
- 203
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Coordination sequence for sigma-CrFe, Position Xa.at n=32A009962
- Convolution of (F(2), F(3), F(4), ...) and A001950.at n=14A023654
- Number of Dyck paths such that the sum of the peak-abscissae is n.at n=49A129528
- Triangle of coefficients of polynomials H(n,x)=(U^n+L^n)/2+(U^n-L^n)/(2d), where U=x+d, L=x-d, d=(x+4)^(1/2).at n=60A163762
- Smallest k > 0 such that (5^n+k)*5^n-1 and (5^n+k)*5^n+1 are a twin prime pair.at n=47A212487
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 315", based on the 5-celled von Neumann neighborhood.at n=13A281045
- The number of partitions of n which represent Chomp positions with Sprague-Grundy value 9.at n=56A284782
- a(n) = Sum_{k=1..n} binomial(2*n, n-k) * sigma(k).at n=6A356338