6596
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 12348
- Proper Divisor Sum (Aliquot Sum)
- 5752
- 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
- 3072
- Möbius Function
- 0
- Radical
- 3298
- 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
- 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
- yes
- Odd
- no
Appears in sequences
- Number of vectors abcdefg with a,b,... >= 0, a+...+g=n, a>={b,...g}.at n=14A014073
- a(n) = Sum_{k=floor((n+1)/2)..n} T(k,n-k); i.e., a(n) is n-th diagonal sum of left-justified array T given by A027011.at n=20A027022
- Number of n-celled P2-oscillators in Conway's game of Life.at n=20A056614
- Satisfies a(n)/A079159(n) = p_n, the n-th prime (n>0), a(0)=1.at n=25A079161
- Numbers k such that 7^k - 2 is a prime.at n=23A090669
- Row sums of triangular matrix A105540, in which column n equals A105540^(n+1) when flattened as read by rows.at n=17A105541
- Numbers k such that phi(k)*sigma(k) is a cube.at n=6A114077
- Limit of reversed rows of triangle A126347, in which row sums equal Bell numbers (A000110).at n=20A126348
- Nearest integer to the space diagonal of the smallest (measured by the longest edge) primitive (gcd(a,b,c)=1) Euler bricks (a, b, c, sqrt(a^2 + b^2), sqrt(b^2 + c^2), sqrt(a^2 + c^2) are integers). If the space diagonal is an integer then the Euler brick is called a "perfect cuboid". There are no known perfect cuboids.at n=11A141029
- n-th prime*8-7 is the square of a prime.at n=32A169583
- Where zeros occur in the 1-0 race in the binary expansion of Pi-3; that is, n such that A174832(n) = 0.at n=24A178980
- Anti-amicable numbers.at n=5A192290
- Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having three, four or five distinct values for every i,j,k<=n.at n=12A211570
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and 2w^2<=x^2+y^2.at n=22A211806
- a(n) = 4*n*(n^2 + 2)/3.at n=17A217873
- Let sigma*_m (n) be result of applying sum of anti-divisors m times to n; call n (m,k)-anti-perfect if sigma*_m (n) = k*n; sequence gives the (2,k)-anti-perfect numbers.at n=20A229860
- Let sigma*_m (n) be result of applying sum of anti-divisors m times to n; call n (m,k)-anti-perfect if sigma*_m (n) = k*n; sequence gives the (4,k)-anti-perfect numbers.at n=19A229862
- Numbers k such that k+x+y is a square, where x and y are the two squares nearest to k.at n=47A238489
- Floor(7n^2/2) + floor(5n/2) + floor(3n/7).at n=42A239831
- Numbers whose arithmetic derivative is equal to their BCR, where BCR = A036044, binary-complement-and-reverse = take one's complement then reverse bit order.at n=5A269633