17405
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 21246
- Proper Divisor Sum (Aliquot Sum)
- 3841
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13688
- Möbius Function
- 0
- Radical
- 295
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 79
- 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
- no
- Odd
- yes
Appears in sequences
- Witt vector *2!.at n=9A006173
- Composite numbers whose prime factors contain no digits other than 5 and 9.at n=11A036321
- Composite numbers k such that sigma(k) / d(k) is prime.at n=21A048969
- Smallest of 4 consecutive numbers each divisible by a square.at n=29A070284
- Numbers k such that numerator of Bernoulli(2k) is divisible by the square of 59, the second irregular prime.at n=24A093058
- Expansion of eta(q^3) * eta(q^33) / ( eta(q)* eta(q^11)) in powers of q.at n=46A128663
- 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, 1), (-1, 1, 1), (0, 0, 1), (1, 0, -1)}.at n=11A148089
- a(n) = 2*a(n-1) + 3 for n>1, a(1)=14.at n=10A156203
- a(n) = 12*n^2 + 2*n + 1.at n=38A194454
- Number of n X 2 0..4 arrays with each element equal to the number its horizontal and vertical neighbors unequal to itself.at n=19A195956
- Positions of 3's in A234323.at n=43A234804
- Number of partitions p of 2n-1 such that n - (number of parts of p) is a part of p.at n=22A238641
- Numbers k such that the sum of the divisors of k is divisible by the number of divisors of k, and the sum of the squares of the divisors of k is divisible by the sum of the divisors of k.at n=40A277553
- Number of nX6 0..1 arrays with every element equal to 1, 2, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=8A298658
- a(n) = (-1)^n + 2 * Sum_{k=0..n-1} a(k) * a(n-k-1).at n=7A337168
- Numbers p^2*q, p > q odd primes such that q divides p+1.at n=14A350245
- Number of integer partitions of n whose run-sums are not weakly decreasing.at n=37A357878
- a(n) = n*2^10 - 3.at n=16A362361
- G.f. A(x) satisfies A(x) = 1/((1 - x) * (1 - x*A(x)^3 - x^2*A(x)^2*A'(x))).at n=5A385767
- Numbers k such that sigma(k) = psi(k) + tau(k).at n=30A387953