17802
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 41184
- Proper Divisor Sum (Aliquot Sum)
- 23382
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5544
- Möbius Function
- 0
- Radical
- 5934
- Omega Function (Ω)
- 5
- 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
- yes
- 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
- Inverse Moebius transform of Fibonacci numbers 1,1,2,3,5,8,...at n=21A007435
- Numbers k such that k and 4*k are anagrams.at n=5A023088
- Positive numbers k such that (k+1)*(k+2)*(k+3)*(k+4)/(k+(k+1)+(k+2)+(k+3)+(k+4)) is an integer.at n=25A032795
- Number of step shifted (decimated) sequences using a maximum of three different symbols.at n=10A056372
- Numbers n such that 8*10^n + 4*R_n - 3 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=16A103079
- Number of distinct n-th rows in arrays whose columns are running modulus recurrence sequences.at n=11A208125
- Number of partitions of n such that (greatest part) > (multiplicity of least part).at n=37A240184
- Numbers x whose digits can be permuted to produce a multiple of x.at n=33A245680
- Expansion of Product_{k>=1} (1+x^k)^(k*(k-1)*(k-2)).at n=11A258345
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-2)*b(n-1)*b(n), where a(0) = 2, a(1) = 4, b(0) = 1, b(1) = 3, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=10A296282
- Numbers k such that k and k + 1 are both Niven numbers in base 3/2 (A342426).at n=34A342427
- Expansion of e.g.f. ( Product_{k>0} 1/(1 - x^k/k!) )^(1/(1-x)).at n=6A356409
- Number of 4-cycles in the n-cycle complement and (n+1)-wheel complement graph.at n=20A367985
- Expansion of g^2/(1 - x^3*g), where g = 1+x*g^4 is the g.f. of A002293.at n=6A389653