6597
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 9542
- Proper Divisor Sum (Aliquot Sum)
- 2945
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4392
- Möbius Function
- 0
- Radical
- 2199
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- 31
- 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
- no
- Odd
- yes
Appears in sequences
- Expansion of 1/Product_{m>=1} (1 - m*q^m)^2.at n=10A022726
- a(n) = [ a(n-1)/a(1) ] + [ a(n-1)/a(2) ] + ... + [ a(n-1)/a(n-1) ] for n >= 3, with initial terms 2,1.at n=10A022874
- Numbers k such that Fib(k) == -34 (mod k).at n=39A023169
- a(n) = [ (3rd elementary symmetric function of P(n))/(first elementary symmetric function of P(n)) ], where P(n) = {1, p(1), p(2), ..., p(n-1)}, where p(0) = 1.at n=11A024532
- Numbers having three 0's in base 9.at n=19A043455
- Numbers that are the product of 3 prime factors whose concatenation is a palindrome.at n=20A046452
- Numbers m such that 2^m reversed is prime.at n=25A057708
- Dimensions of graded algebra associated with meanders (subalgebra version).at n=9A060089
- Let f(n, m) = binomial(n - m/2 + 1, n - m + 1) - binomial(n - m/2, n - m + 1) and let s(n) = Sum_{k=0..n} f(n, k); then a(n) = numerator of s(n).at n=6A072287
- 45-gonal numbers: n*(43*n-41)/2.at n=17A098924
- Structured pentagonal icositetrahedral numbers (vertex structure 10).at n=8A100168
- Records in A104883.at n=18A104884
- a(1) = 393; for n > 1, a(n) = a(n-1) + 1 + sum of distinct prime factors of a(n-1) that are < a(n-1). edit.at n=40A105210
- a(n+3) = 5*a(n+2) - 2*a(n+1) - 8*a(n), a(0) = 1, a(1) = 0, a(2) = 3.at n=8A110613
- Total number of parts that appear exactly once in the partitions of n into odd parts.at n=49A116665
- Q_n(4) (see A104035).at n=4A156132
- a(n) = (2*n^3 + 5*n^2 - 5*n)/2.at n=17A162265
- Number of n X 8 binary arrays with all 1's connected, a path of 1's from top row to bottom row, and no 1 having more than two 1's adjacent.at n=2A163720
- Number of n X 3 binary arrays with all 1s connected, a path of 1s from left column to right column, and no 1 having more than two 1s adjacent.at n=7A163724
- a(0) = 0 and a(n) = (4*n^3 - 12*n^2 + 20*n - 9)/3 for n >= 1.at n=18A174794