16897
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 31
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17236
- Proper Divisor Sum (Aliquot Sum)
- 339
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16560
- Möbius Function
- 1
- Radical
- 16897
- 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
- 128
- 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
- Numbers that are the sum of 6 positive 7th powers.at n=32A003373
- From a nim-like game.at n=35A003412
- a(n) = 3*a(n-1) + a(n-2), with a(1)=1 and a(2)=4.at n=8A003688
- Smallest number that requires n iterations of the bi-unitary totient function (A116550) to reach 1.at n=45A005424
- Pseudoprimes to base 60.at n=33A020188
- Numbers k such that the continued fraction for sqrt(k) has period 75.at n=15A020414
- a(n) = 512*n + 1.at n=33A076338
- Product of twin-prime-indexed primes and their upper bound twin prime.at n=6A080699
- Replace 0 with 0000 in binary representation of n.at n=40A084473
- a(n) = n-th centered n-gonal number.at n=32A100119
- Fixed-k dispersion for Q = 13: array D(g,h) (g, h >= 1), read by ascending antidiagonals.at n=14A120863
- Triangular array read by rows: see Comments for definition.at n=38A121875
- a(n) = 66*n^2 + 1.at n=16A158689
- Maximum number of rational points on a smooth absolutely irreducible projective curve of genus 2 over the field F_2^n.at n=13A169873
- Centered 32-gonal numbers.at n=32A195315
- Largest number in a 6-tuple (a,b,c,d,e,f) of positive integers satisfying the Markoff(6) equation a^2 + b^2 + c^2 + d^2 + e^2 + f^2 = 3*a*b*c*d*e*f.at n=34A227204
- List of quadruples (r,s,t,u): the matrix M = [[4,12,9][2,5,3][1,2,1]] is raised to successive powers, then (r,s,t,u) are the square roots of M[3,1], M[3,3], M[1,1], M[1,3] respectively.at n=37A249579
- Number of (n+1) X (7+1) 0..1 arrays with each 2 X 2 subblock having clockwise pattern 0000 0001 0011 or 0111.at n=0A259426
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0001 0011 or 0111.at n=21A259427
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0001 0011 or 0111.at n=27A259427