6196
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 10850
- Proper Divisor Sum (Aliquot Sum)
- 4654
- 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
- 3096
- Möbius Function
- 0
- Radical
- 3098
- 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
- 124
- 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
- Maximal number of regions obtained by joining n points around a circle by straight lines. Also number of regions in 4-space formed by n-1 hyperplanes.at n=20A000127
- Number of Hamiltonian graphs with n nodes.at n=7A003216
- Coefficients of the '2nd-order' mock theta function A(q).at n=32A006304
- Place n equally-spaced points around a circle and join every pair of points by a chord; this divides the circle into a(n) regions.at n=20A006533
- Expansion of sinh(sinh(log(1+x))).at n=7A009597
- a(n) = Sum_{i=1..floor((n+1)/4)} a(2*i-1) * a(n-2*i+1), with a(1)=a(2)=1 and a(3)=4.at n=14A024727
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 68 ones.at n=0A031836
- Denominators of continued fraction convergents to sqrt(302).at n=10A041569
- Numbers having four 4's in base 6.at n=12A043388
- Numbers having three 4's in base 9.at n=31A043471
- Composite numbers not ending in zero that yield a prime when turned upside down.at n=36A048889
- a(n+1) is the smallest number > a(n) such that the digits of a(n)^2 are all (with multiplicity) contained in the digits of a(n+1)^2, with a(0)=2.at n=9A067975
- Number of configurations of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square at one of the 4 central squares.at n=11A090164
- Number of squares on infinite quarter chessboard at <=n knight moves from the corner.at n=42A098500
- Coordination sequence for octagonal tiling is a(n)*sqrt(2) + A103909(n).at n=23A103908
- Triangle arising in connection with deformations of type D Kleinian singularities.at n=26A108959
- Number of 1's in A127962(n).at n=27A127963
- Triangle read by rows: T(n,k) is the number of paths in the first quadrant from (0,0) to (n,0), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having k doublerises (i.e., UU's) (0 <= k <= floor(n/2) - 1 for n >= 2).at n=34A132279
- Let P(A) denote the power set of an n-element set A. Then a(n) = the number of pairs of elements {x,y} of P(A) for which either 0) x and y are disjoint and for which x is not a subset of y and y is not a subset of x, 1) x and y are disjoint and for which either x is a subset of y or y is a subset of x, or 2) x and y intersect but for which x is not a subset of y and y is not a subset of x.at n=7A133789
- Partial sums of partial sums of PrimePi(k).at n=44A137441