16410
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 39456
- Proper Divisor Sum (Aliquot Sum)
- 23046
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4368
- Möbius Function
- 1
- Radical
- 16410
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 40
- 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
- a(n) = floor(5^n/3^n).at n=19A094974
- Let f(x)=(largest digit of x)^(smallest digit of x) + x (A097385). Sequence gives numbers n such that f(n) and f(n+1) are both prime.at n=37A097387
- Number of polyominoes consisting of 6 regular unit n-gons.at n=18A103472
- Negative numbers written in a bits-of-Pi/primorial base system.at n=7A109839
- Related to the minimal number of periodic orbits of periods guaranteed by Sharkovskii's theorem.at n=38A130628
- Number of partitions of the graph G_n (defined below) into "strokes".at n=13A131520
- Half the number of length n integer sequences with sum zero and sum of squares 5832.at n=3A157586
- Number of n element 0..3 arrays with each element the minimum of 7 adjacent elements of a random 0..3 array of n+6 elements.at n=11A217953
- Triangle read by rows: T(n,k) = number of plateau polycubes of width n and volume k.at n=61A232483
- Number of (n+1)X(1+1) 0..1 arrays x(i,j) with row sums sum{x(i,j), j=1..1+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..n+1} nondecreasing.at n=11A233297
- a(n) = Sum_{d|n} d * binomial(n,d).at n=14A367864
- Triangle read by rows: T(n, k) = n! * 3^k * hypergeom([-k], [-n], -1/3).at n=24A375446