17464
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
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 34200
- Proper Divisor Sum (Aliquot Sum)
- 16736
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8352
- Möbius Function
- 0
- Radical
- 4366
- 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
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 17 ones.at n=19A031785
- Numerators of continued fraction convergents to sqrt(766).at n=8A042476
- Numbers n such that sum of cubes of even digits of n equals sum of cubes of odd digits of n.at n=10A076165
- Triangle read by rows: A011971 * A007318^(-1).at n=29A136790
- Partial sums of A003325.at n=42A139211
- E.g.f. A(x) satisfies A''(x)+A'(x)=exp(A(x))+1.at n=10A200949
- Number of (n+1) X (1+1) 0..3 arrays with the minimum plus the maximum equal to the lower median plus the upper median in every 2 X 2 subblock.at n=3A236003
- Number of (n+1)X(4+1) 0..3 arrays with the minimum plus the maximum equal to the lower median plus the upper median in every 2X2 subblock.at n=0A236006
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the minimum plus the maximum equal to the lower median plus the upper median in every 2X2 subblock.at n=6A236009
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the minimum plus the maximum equal to the lower median plus the upper median in every 2X2 subblock.at n=9A236009
- Number of nX5 0..2 arrays with no element equal to zero plus the sum of elements to its left or zero plus the sum of elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 3.at n=12A240036
- a(n) = n*(n + 11)*(n + 22)/6.at n=37A264445
- Coefficients in level 23 Ramanujan-Sato series for 1/Pi.at n=6A386793