17060
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 35868
- Proper Divisor Sum (Aliquot Sum)
- 18808
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6816
- Möbius Function
- 0
- Radical
- 8530
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 172
- 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 binary rooted trees with n nodes and height exactly 6.at n=22A036595
- a(n) = A047098(n)/2.at n=6A047099
- Trajectory of 290 under the Reverse and Add! operation carried out in base 4, written in base 10.at n=4A075299
- Expansion of f(x^3)/(1-x*f(x^3)), where f(x) is the g.f. of A001764, whose n-th term is binomial(3n,n)/(2n+1).at n=20A126042
- Sequence h_n arising in enumeration of arrays of directed blocks (see Quaintance reference for precise definition).at n=13A129874
- n^2 + {1,3,7} are primes.at n=42A182238
- a(n) = (122n^3 + 140n^2 + 45n + 3n(-1)^n)/8.at n=10A191698
- Number A(n,k) of 3n-length k-ary words, either empty or beginning with the first letter of the alphabet, that can be built by repeatedly inserting triples of identical letters into the initially empty word; square array A(n,k), n>=0, k>=0, by antidiagonals.at n=52A213027
- a(n) = A273059(4n).at n=23A275916
- Numbers m > 0 that have a divisor d > 1 with binomial(m+d, d) == 1 mod m.at n=28A290040
- G.f.: x * Sum_{k>=1} x^k / (1 - a(k)*x^k).at n=75A309633
- Triangle read by rows: T(n,k) is the number of digraphs on n labeled nodes with k arcs and a global source (or sink), n >= 1, k = 0..(n-1)^2.at n=24A350793
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of 1/(2 - B_k(x)), where B_k(x) = 1 + x*B_k(x)^k.at n=62A382100