6830
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12312
- Proper Divisor Sum (Aliquot Sum)
- 5482
- 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
- 2728
- Möbius Function
- -1
- Radical
- 6830
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 150
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Inverse Moebius transform of Fibonacci numbers 1,1,2,3,5,8,...at n=19A007435
- Number of distinct nonzero absolute values of Sum_{j=1..n} sigma_j * exp(i * Pi * j / n) where sigma_j = +- 1.at n=18A013914
- Numbers with exactly five distinct base-9 digits.at n=34A031986
- First differences give (essentially) A028242.at n=39A035107
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 2.at n=45A050061
- Numbers k such that k! is divisible by the square of (f+d)!^2 for d = 0, 1 and 2 (and possibly larger d), where f = floor(k/2).at n=28A056068
- Numbers k such that k^12 == 1 (mod 13^3).at n=37A056086
- a(n) = floor(e^(n/e)).at n=24A061481
- Number of distinct magnitudes of the nonzero sums of distinct n-th roots of unity.at n=18A108381
- Number of "squashed-tree" graphs with n central nodes, the labeled case, not allowing the direct link between L and R.at n=4A138560
- a(n) = 5*(-1)^n*A078008(n).at n=12A156550
- Half the number of length n integer sequences with sum zero and sum of squares 2048.at n=3A157564
- Numerator of A166100(A166101(n))/A166102(n).at n=19A166272
- Products of the Jacobsthal numbers and the integers: a(n) = n * A001045(n+1).at n=10A193449
- Number of ordered triples (w,x,y) with all terms in {-n,...,-1,1,...,n} and w+3x+3y>0.at n=12A211625
- Number of (w,x,y,z) with all terms in {1,...,n} and w+x+y=|x-y|+|y-z|.at n=30A212678
- a(n) = !n mod n!!.at n=11A216445
- Related to Pisano periods: numbers n such that there are n+10 distinct Fibonacci numbers mod n.at n=21A229467
- Difference between sum of first n primes and prime(prime(n)).at n=63A239731
- Number of nonnegative integers with property that their base 5/3 expansion (see A024633) has n digits.at n=15A245418