17499
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 24640
- Proper Divisor Sum (Aliquot Sum)
- 7141
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11016
- Möbius Function
- -1
- Radical
- 17499
- Omega Function (Ω)
- 3
- 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
- 110
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 88.at n=28A031586
- Expansion of Sum_{n>=0} (q^n / Product_{k=1..n+5} (1 - q^k)).at n=31A035301
- a(0) = 1, a(1) = 3; for n >= 2 a(n) is the number of degree-n monic reducible polynomials over GF(3), i.e., a(n) = 3^n - A027376(n).at n=9A058818
- Convolution of L(n+1) := A000204(n+1) (Lucas), n>=0, with L(n+2), n>=0.at n=12A067980
- Numbers n such that 6*10^n + 4*R_n - 1 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=22A103035
- A transform of the central binomial coefficients C(n,floor(n/2)).at n=13A119967
- 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, 0), (-1, 1, -1), (1, 0, -1), (1, 0, 1), (1, 1, -1)}.at n=9A149103
- a(n) = 625*n - 1.at n=27A158374
- a(n) = 28*n^2 - 1.at n=24A158554
- Numbers n such that 30n-13, 30n-11, 30n-1, 30n+1, 30n+11, 30n+13 are all prime.at n=11A175683
- a(n) = n^3 - 3n^2 + 3.at n=27A177058
- Partial sums of A045542.at n=43A177955
- Half the number of (n+1)X(n+1) symmetric 0..5 arrays with no 2X2 subblock summing to 10.at n=1A213694
- T(n,k)=Half the number of (n+1)X(n+1) symmetric 0..k arrays with no 2X2 subblock summing to 2k.at n=16A213697
- Half the number of 3 X 3 0..n symmetric arrays with no 2 X 2 subblock summing to 2n.at n=4A213698
- a(n) = 3*a(n-1) + 24*a(n-2) + a(n-3), with a(0)=0, a(1)=2, and a(2)=7.at n=6A217069
- a(n) = 3*a(n-3) + a(n-2), a(0)=3, a(1)=0, a(2)=2.at n=19A231101