17608
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
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 34560
- Proper Divisor Sum (Aliquot Sum)
- 16952
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8400
- Möbius Function
- 0
- Radical
- 4402
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 3
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
- 141
- Smith Number
- no
- 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
- In A015922, not in A033553.at n=28A033554
- Duplicate of A130134.at n=4A033555
- Terms in A015922 not divisible by 3.at n=8A130133
- Even terms in A015922.at n=4A130134
- Numbers n such that sigma(lambda(n)) = lambda(sigma(n)).at n=35A173942
- T(n,k)=Number of (n+1)X(k+1) 0..4 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=10A186484
- T(n,k)=Number of (n+1)X(k+1) 0..4 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=14A186484
- Number of subsets of {1, 2, ..., n} containing n and having <=7 pairwise coprime elements.at n=44A186991
- T(n,m)=Number of (n+1)X2 0..m arrays with every 2X2 subblock commuting with each of its vertical 2X2 subblock neighbors.at n=32A187363
- T(n,m)=Number of (n+1)X6 0..m arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=6A188837
- a(n) = A192815(n)/2.at n=8A192816
- a(n) = n*(14*n + 13) + 3.at n=35A195029
- Sophie Germain 5-almost primes.at n=33A211162
- a(n) = Sum_{i=0..n} digsum(i)^4, where digsum(i) = A007953(i).at n=15A231689
- Number of (n+2)X(3+2) 0..1 arrays with every 2X2 and 3X3 subblock diagonal sum minus antidiagonal sum unequal to its neighbors horizontally and vertically.at n=3A253735
- Number of (n+2) X (4+2) 0..1 arrays with every 2 X 2 and 3 X 3 subblock diagonal sum minus antidiagonal sum unequal to its neighbors horizontally and vertically.at n=2A253736
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 2X2 and 3X3 subblock diagonal sum minus antidiagonal sum unequal to its neighbors horizontally and vertically.at n=17A253740
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 2X2 and 3X3 subblock diagonal sum minus antidiagonal sum unequal to its neighbors horizontally and vertically.at n=18A253740
- Consider a number x. Take the sum of its digits. Repeat the process deleting the first addendum and adding the previous sum. The sequence lists the numbers that after some iterations reach the sum of the divisors of x.at n=10A269308
- Number of ternary strings of length n that contain at least one 0 and at most two 1's.at n=10A338229