6548
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 11466
- Proper Divisor Sum (Aliquot Sum)
- 4918
- 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
- 3272
- Möbius Function
- 0
- Radical
- 3274
- 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
- 44
- 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)=2a(n-1)+3a(n-2)+2a(n-3)+3a(n-4).at n=7A022015
- Floor of area of triangle with consecutive prime sides.at n=29A096377
- Number of noncongruent n-dimensional integer-sided simplices with diameter 3.at n=7A097128
- Triangle read by rows: row n is the expansion of p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 3)*Sum[(2^(m - 1) +n*m - n + 1)*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}].at n=48A146967
- Triangle read by rows: row n is the expansion of p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 3)*Sum[(2^(m - 1) +n*m - n + 1)*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}].at n=51A146967
- Nonprimes formed by concatenation of the decimal digits of a nonprime and its index.at n=40A154507
- Expansion of (1/(1-x))*c(x/(1-x)^4), c(x) the g.f. of A000108.at n=6A162476
- Numbers n such that 15*prime(n)+{-4,-2,2,4} are all primes.at n=21A176002
- Number of n X 3 0..3 arrays with values 0..3 introduced in row major order and no element equal to any horizontal or vertical neighbor.at n=3A198710
- Number of n X 4 0..3 arrays with values 0..3 introduced in row major order and no element equal to any horizontal or vertical neighbor.at n=2A198711
- T(n,k)=Number of nXk 0..3 arrays with values 0..3 introduced in row major order and no element equal to any horizontal or vertical neighbor.at n=17A198715
- T(n,k)=Number of nXk 0..3 arrays with values 0..3 introduced in row major order and no element equal to any horizontal or vertical neighbor.at n=18A198715
- Matula-Goebel numbers of rooted trees with no perfect matching and such that 2 is an eigenvalue of the Laplacian matrix.at n=22A202852
- Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 149", based on the 5-celled von Neumann neighborhood.at n=41A270317
- Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 393", based on the 5-celled von Neumann neighborhood.at n=47A271602
- Numbers such that antisigma(n) mod sigma(n) = d(n), where antisigma(n) is the sum of the numbers less than n that do not divide n, sigma(n) is the sum of the divisors of n and d(n) is the number of divisors of n.at n=45A272337
- Numbers k such that (26*10^k - 119)/3 is prime.at n=20A274238
- a(n) = 12*n^2 + 10*n - 30.at n=23A277982
- Numbers k such that (134*10^k + 7)/3 is prime.at n=18A282975
- Number of nX6 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 0, 2 or 3 neighboring 1s.at n=2A297635