17119
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19440
- Proper Divisor Sum (Aliquot Sum)
- 2321
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14976
- Möbius Function
- -1
- Radical
- 17119
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 79
- 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
- a(n) is the concatenation of n and 7n.at n=16A009441
- a(n) = n*(5*n^2 - 3)/2.at n=19A063522
- Composite numbers k such that k divides F(k-1) where F(j) are the Fibonacci numbers.at n=10A069106
- a(n) is the smallest multiple of n such that a(n) mod 100 = n and S(n)=n where S(n) is the sum of the base-ten digits of n, or 0 if no such a(n) exists.at n=18A075154
- Odd Fibonacci pseudoprimes: odd composite numbers k such that either (1) k divides Fibonacci(k-1) if k == +-1 (mod 5) or (2) k divides Fibonacci(k+1) if k == +-2 (mod 5).at n=14A081264
- Starting positions of strings of three 9's in the decimal expansion of Pi.at n=12A083642
- Numbers k that divide Fibonacci(k-1) but do not divide Fibonacci(k) - 1.at n=5A094410
- Expansion of 1/((1-x)^3 - 18*x^4)^(1/3).at n=12A098538
- a(n) = concatenation of (n times each digit of n).at n=16A111704
- Multiples of 19 containing a 19 in their decimal representation.at n=28A121039
- Numbers with sum of digits = 19, divisible by 19 and containing the string "19".at n=0A121669
- Number of twin prime members occurring in the sequence of prime-indexed primes for indices up to 10^n.at n=4A128246
- Numbers which are the sum of the squares of seven consecutive primes.at n=11A133562
- Least k such that the cyclotomic polynomial Phi(k,x) contains n or -n as a coefficient, where k is restricted to be the product of 3 distinct prime numbers.at n=5A134518
- A bisection of A063522.at n=9A160674
- Triangle read by rows: T(n,k) is the number of 2-compositions of n having k even entries (0<=k<=n).at n=59A181297
- Composite numbers k that divide Fibonacci(k+1) or Fibonacci(k-1).at n=18A182554
- T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=5A186488
- T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=3A186488
- T(n,m)=Number of (n+1)X2 0..m arrays with every 2X2 subblock commuting with each of its vertical 2X2 subblock neighbors.at n=30A187363