17794
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 32256
- Proper Divisor Sum (Aliquot Sum)
- 14462
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7200
- Möbius Function
- 1
- Radical
- 17794
- 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
- 35
- 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
- Number of n-stacks with strictly receding walls, or the number of Type A partitions of n in the sense of Auluck (1951).at n=40A001522
- Divide even numbers into groups with prime(n) elements and add together.at n=12A034959
- Numbers n such that [A070080(n), A070081(n), A070082(n)] is an obtuse isosceles integer triangle with prime side lengths.at n=25A070135
- Number of nonisomorphic (undirected) Cayley graphs for the group Zp x Zp, where Zp is the elementary Abelian group of order p and p is prime. The sequence is index by primes, though starts with 1.at n=3A070995
- a(n) = Fibonacci(n-1) + prime(n).at n=22A113753
- Numbers k such that there is a number m < k satisfying A000203(k) = A000203(m) = m + k - gcd(m,k).at n=30A124141
- Number of strip poly-IH64-tiles (holes allowed) with n cells.at n=12A151526
- Number of strings of numbers x(i=1..n) in 0..2 with sum i^3*x(i)^2 equal to n^3*4.at n=19A184296
- Number of (n+1)X5 binary arrays with every 2X2 subblock diagonal sum less antidiagonal sum equal to some horizontal or vertical neighbor 2X2 subblock diagonal sum less antidiagonal sum.at n=4A186123
- Number of (n+1)X6 binary arrays with every 2X2 subblock diagonal sum less antidiagonal sum equal to some horizontal or vertical neighbor 2X2 subblock diagonal sum less antidiagonal sum.at n=3A186124
- T(n,k) = Number of (n+1) X (k+1) binary arrays with every 2 X 2 subblock diagonal sum less antidiagonal sum equal to some horizontal or vertical neighbor 2 X 2 subblock diagonal sum less antidiagonal sum.at n=31A186128
- T(n,k) = Number of (n+1) X (k+1) binary arrays with every 2 X 2 subblock diagonal sum less antidiagonal sum equal to some horizontal or vertical neighbor 2 X 2 subblock diagonal sum less antidiagonal sum.at n=32A186128
- Numbers n such that n = x + y, sigma_1(n) = sigma_1(x) + sigma_1(y) and sigma_2(n) = sigma_2(x) + sigma_2(y).at n=10A219033
- Number of partitions of n with rank 4 (the rank of a partition is the largest part minus the number of parts).at n=54A363213