6532
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 12096
- Proper Divisor Sum (Aliquot Sum)
- 5564
- 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
- 3080
- Möbius Function
- 0
- Radical
- 3266
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 137
- 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
- Fibonacci sequence beginning 1, 6.at n=16A022096
- a(n) = 3*a(n-1) - a(n-2) with a(0)=1, a(1)=7.at n=8A055267
- Number of hexagonal regions in regular n-gon with all diagonals drawn.at n=40A067153
- Numbers n such that 2*p(n)+3, 2*p(n+1)+3, 2*p(n+2)+3 are consecutive primes, where p(i) denotes the i-th prime.at n=6A088066
- Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k low humps.at n=38A101281
- a(n) = n*(3*n + 4).at n=46A140676
- Antidiagonal sums of the array A051776.at n=41A141395
- Array t(n, k) = (k*(n-1) +2-k)*t(n-1, k) + k*t(n-2, k), with t(1, k) = 1, t(2, k) = 2, read by antidiagonals.at n=50A144446
- Half the difference between the larger and smaller term of the n-th amicable pair.at n=8A162884
- Number of different fixed (possibly) disconnected trominoes bounded tightly by an n X n square.at n=33A163433
- Number of 3-step one space at a time bishop's tours on an n X n board summed over all starting positions.at n=24A187156
- Walks with n steps on the x-axis using steps {1,0,-1} and visiting no point more than twice.at n=13A212589
- Greatest number (in decimal representation) with n nonprime substrings in base-3 representation (substrings with leading zeros are considered to be nonprime).at n=19A217113
- Number of 5 X 5 0..n matrices with each 2 X 2 subblock idempotent.at n=33A224667
- Number of subsets of {1,2,...,n-10} without differences equal to 2, 4, 6, 8 or 10.at n=41A224812
- Number of (n+1) X (2+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings).at n=5A235292
- Number of (n+1) X (6+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings).at n=1A235296
- T(n,k) is the number of (n+1) X (k+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings).at n=26A235301
- T(n,k) is the number of (n+1) X (k+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings).at n=22A235301
- Numbers n such that n + prime(n), n + 1 + prime(n+1) and n + 2 + prime(n+2) are divisible by 7.at n=42A239457