6193
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6768
- Proper Divisor Sum (Aliquot Sum)
- 575
- 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
- 5620
- Möbius Function
- 1
- Radical
- 6193
- Omega Function (Ω)
- 2
- 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
- 186
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- From von Staudt-Clausen representation of Bernoulli numbers: a(n) = Bernoulli(2n) + Sum_{(p-1)|2n} 1/p.at n=10A000146
- Numbers k such that the continued fraction for sqrt(k) has period 80.at n=19A020419
- Number of positive integers that are not the sum of distinct n-th-order polygonal numbers.at n=40A025524
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 44 ones.at n=17A031812
- a(1) = 2; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=42A074338
- Numbers n such that when the digits of Fibonacci(n) are sorted into decreasing order and zeros are dropped it is a prime.at n=43A082922
- Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(60+I*11)/61.at n=20A084804
- Frequency of the hexadecimal C in the first 10^n hexadecimal digits of Pi.at n=4A099345
- Numbers n such that the numbers of divisors of n,n+1 and n+2 are k,2k,4k respectively for some k.at n=43A100363
- a(n) = n^3 + (n+1)^2.at n=18A100705
- A generalized Chebyshev transform of the Fibonacci numbers.at n=11A105866
- Semiprimes (A001358) whose digit reversal is a triangular number.at n=26A115741
- Expansion of (1-3x)/(1-x^2+x^3).at n=30A117374
- Row sums of triangle A143102.at n=25A143103
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (0, 0, 1), (0, 1, 1), (1, -1, -1)}.at n=8A149870
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 1, 0), (0, 1, 1), (1, -1, -1)}.at n=8A149871
- a(n) = 144*n + 1.at n=42A158133
- Number of binary strings of length n with no substrings equal to 0000 0001 or 0100.at n=11A164409
- Convolution of A007947 with itself.at n=40A175703
- Number of nX1 0..5 arrays with every element value z a city block distance of exactly z from another element value z.at n=9A208957