17334
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
- 3
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 39204
- Proper Divisor Sum (Aliquot Sum)
- 21870
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5724
- Möbius Function
- 0
- Radical
- 642
- Omega Function (Ω)
- 6
- 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
- 128
- 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
- a(n) = round(n*phi^18), where phi is the golden ratio, A001622.at n=3A004953
- a(n) = ceiling(n*phi^18), where phi is the golden ratio, A001622.at n=3A004973
- Numbers n such that n divides n-th Lucas number A000032(n).at n=11A016089
- Fibonacci sequence beginning 3, 9.at n=17A022379
- a(n)=(1/2)*T(2n+1,n+1), where T is given by A048113.at n=8A048119
- Numbers k such that k*2^(k/2) + 1 is prime.at n=9A058767
- Sum of next F(n) Fibonacci numbers, where F(n) = n-th Fibonacci number.at n=6A077537
- a(n) = sum of the first n lower twin primes.at n=39A086167
- Triangle read by rows in which row n gives coefficients of polynomial R_n(y) that satisfies R_n(1/3) = 3^n, where R_n(y) forms the initial (n+1) terms of g.f. A057083(y)^(n+1).at n=32A097186
- Partial sums of A000960.at n=39A099074
- a(1) = 1; for n > 1, a(n) is the least k > a(n-1) such that a(n) + a(n-1) is square and a(n) - a(n-1) is prime.at n=24A108972
- 9 times pentagonal numbers: 9*n*(3*n-1)/2.at n=36A152996
- Number of binary strings of length n with equal numbers of 00110 and 01010 substrings.at n=15A164252
- Let S be the sequence Fibonacci(2n), n>0 (cf. A001906); sequence lists the differences S(j)-S(i) for i<j.at n=48A169690
- Number of permutations of 1..n avoiding adjacent step pattern up, down, down.at n=8A177479
- Numbers k such that there is 1 prime between 100*k and 100*k + 99.at n=17A186393
- s(k)-s(j), where the pairs (k,j) are given by A205857 and A205858, and s(k) denotes the (k+1)-st Fibonacci number.at n=31A205859
- [s(k)-s(j)]/7, where the pairs (k,j) are given by A205862 and A205863, and s(k) denotes the (k+1)-st Fibonacci number.at n=42A205865
- s(k)-s(j), where the pairs (k,j) are given by A205872 and A205873, and s(k) denotes the (k+1)-st Fibonacci number.at n=18A205874
- Total number of smallest parts that are also emergent parts in all partitions of n.at n=41A220479