17668
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
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 35392
- Proper Divisor Sum (Aliquot Sum)
- 17724
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 7560
- Möbius Function
- 0
- Radical
- 8834
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 97
- 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
- Number of lines through exactly 5 points of an n X n grid of points.at n=49A018812
- Numbers whose base-4 representation contains exactly four 0's and four 1's.at n=17A045037
- Numbers whose base-5 representation contains exactly three 1's and three 3's.at n=24A045247
- a(n) = Sum_{k=1..n, gcd(n,k) = 1} k^4.at n=11A053820
- Difference between (smallest square strictly greater than 2^n) and 2^n.at n=27A056008
- a(n) = A000695(A014486(n)).at n=11A083931
- Admirable Harshad numbers n such that the subtracted divisor is equal to the digital sum of n.at n=12A111948
- Difference between 2^(2*n-1) and the next larger square.at n=13A238454
- Least number x such that x^n has n digits equal to k. Case k = 2.at n=21A285449
- a(n) = Sum_{1 <= j <= n/2, gcd(j,n)=1} j^4.at n=23A295576
- Number of ways to split an integer partition of n into contiguous subsequences with strictly increasing sums.at n=29A336134