16536
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 45360
- Proper Divisor Sum (Aliquot Sum)
- 28824
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4992
- Möbius Function
- 0
- Radical
- 4134
- Omega Function (Ω)
- 6
- 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
- 159
- Smith Number
- yes
- 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
- Theta series of direct sum of 2 copies of f.c.c. lattice.at n=20A008663
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 15 ones.at n=19A031783
- Smaller of Smith brothers.at n=10A050219
- Bisection of Lucas triangle A060922: odd-indexed members of column sequences of A060922 (not counting leading zeros).at n=33A060924
- Fifth convolution of Lucas numbers A000032(n+1), n >= 0.at n=5A060932
- Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n having k (1,1) steps starting at level zero (can be easily expressed also in RNA secondary structure terminology).at n=46A089736
- If n = Product p_i^r_i let Uphi(n) = Product(p_i^r_i - 1). Call (x,y) a square unitary phi amicable pair if Uphi(x)^2 = Uphi(y)^2 = x^2-y^2. Sequence gives x values for square unitary phi amicable pairs.at n=2A099105
- G.f.: A(x) = exp( Sum_{n>=1} A162552(n) * 2*A006519(n) * x^n/n ).at n=32A161803
- a(n) = number of ordered triples (w,x,y) such that w,x,y are all in {0,...,n} and the numbers |w-x|, |x-y|, |y-w| are distinct.at n=26A212963
- Number of (n+3) X (3+3) 0..2 white square subarrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=3A230703
- Number of (n+3)X(4+3) 0..2 white square subarrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=2A230704
- T(n,k)=Number of (n+3)X(k+3) 0..2 white square subarrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=17A230708
- T(n,k)=Number of (n+3)X(k+3) 0..2 white square subarrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=18A230708
- Number of (n+3)X(4+3) 0..2 black square subarrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=2A230737
- T(n,k)=Number of (n+3)X(k+3) 0..2 black square subarrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=17A230739
- T(n,k)=Number of (n+3)X(k+3) 0..2 black square subarrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=18A230739
- Number of non-equivalent ways to choose 5 points in an equilateral triangle grid of side n.at n=6A231654
- Numbers m such that the GCD of the x's that satisfy sigma(x) = m is 3.at n=28A241648
- Number of (n+2)X(4+2) 0..3 arrays with every 3X3 subblock row and column sum not 1 3 6 or 8 and every diagonal and antidiagonal sum 1 3 6 or 8.at n=4A252049
- Number of (n+2) X (5+2) 0..3 arrays with every 3 X 3 subblock row and column sum not 1 3 6 or 8 and every diagonal and antidiagonal sum 1 3 6 or 8.at n=3A252050