16717
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17020
- Proper Divisor Sum (Aliquot Sum)
- 303
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16416
- Möbius Function
- 1
- Radical
- 16717
- 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
- 66
- 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
- Expansion of the e.g.f. sqrt(exp(x) / (2 - exp(x))).at n=7A014307
- Numbers k such that the continued fraction for sqrt(k) has period 71.at n=8A020410
- Number of ways to tile a 4 X n region with 1 X 1 and 2 X 2 tiles.at n=10A054854
- The next smallest pair of numbers is taken so that a(2n-1)/a(2n) converges to Pi.at n=35A057082
- Number of ways to tile a 10 X n rectangle with 1 X 1 and 2 X 2 tiles.at n=4A063654
- Denominators of convergents to Pi by Farey fractions.at n=15A063673
- Sum of all terms on the two principal diagonals of a 2n+1 X 2n+1 square spiral.at n=14A114254
- The sum of the principal diagonals of an n X n spiral.at n=29A137930
- 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, -1, 0), (-1, 0, 0), (0, 1, -1), (1, 0, -1), (1, 1, 1)}.at n=8A149660
- T(n,k) = Half the number of (n+1) X (k+1) 0..2 arrays with every 2 X 2 subblock diagonal sum differing from its antidiagonal sum by more than 2.at n=37A179618
- T(n,k) = Half the number of (n+1) X (k+1) 0..2 arrays with every 2 X 2 subblock diagonal sum differing from its antidiagonal sum by more than 2.at n=43A179618
- Smallest base b > 1 such that both prime(n) and prime(n+1) are base-b Wieferich primes, i.e., p = prime(n) satisfies b^(p-1) == 1 (mod p^2) and q = prime(n+1) satisfies b^(q-1) == 1 (mod q^2).at n=35A259075
- a(n) = 21*n^2 - 33*n + 13.at n=28A289134
- Number of nX7 0..1 arrays with every element unequal to 0, 1 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=19A317772
- Approximation of the 2-adic integer exp(4) up to 2^n.at n=15A320814
- Approximation of the 2-adic integer exp(4) up to 2^n.at n=16A320814
- Approximation of the 2-adic integer exp(4) up to 2^n.at n=17A320814
- MM-numbers of crossing, capturing multiset partitions (with empty parts allowed).at n=2A326259
- Numbers k such that gcd(2*k^7+1, 3*k^3+2) > 1.at n=14A369153