8230
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14832
- Proper Divisor Sum (Aliquot Sum)
- 6602
- 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
- 3288
- Möbius Function
- -1
- Radical
- 8230
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 114
- 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
- Number of n-bead necklaces with 4 colors.at n=8A001868
- a(0) = 1, a(n) = 17*n^2 + 2 for n>0.at n=22A010007
- Expansion of 1/((1-3x)(1-7x)(1-9x)(1-10x)).at n=3A028093
- An intermediate sequence for nonisomorphic circulant undirected p^2-graphs, indexed by odd primes p.at n=5A038783
- Numbers whose base-4 representation contains exactly three 0's and three 2's.at n=31A045055
- Even numbers seen in decimal expansion of Pi (disregarding the decimal period) contiguous, smallest and distinct.at n=39A050818
- Number of ways to color vertices of an octagon using <= n colors, allowing only rotations.at n=4A054622
- Triangle read by rows: row n (n >= 1) contains the numbers T(n,k) = Sum_{d|n} phi(d)*k^(n/d)/n, for k=1..n.at n=31A054631
- Number of complementary pairs of circulant graphs on n nodes.at n=33A054929
- Number of step shifted (decimated) sequences using exactly two different symbols.at n=16A056376
- Number of primitive (aperiodic) step shifted (decimated) sequences using a maximum of two different symbols.at n=16A056381
- Number of primitive (aperiodic) step shifted (decimated) sequences using exactly two different symbols.at n=16A056386
- Numbers k such that 4^k - 3 is prime.at n=26A059266
- Decimal expansion of Pi written as a sequence of positive integers avoiding duplicates.at n=55A064809
- Number of primes less than 10^n with initial digit 9.at n=5A073509
- Jablonski table T(n,k) read by antidiagonals: T(n,k) = number of necklaces with n beads of k colors.at n=62A075195
- Total number of distinct cycles in a particular cellular automata of size n.at n=21A083843
- Number of necklaces with n beads of 5 colors, no 2 adjacent beads the same color.at n=7A106367
- Row sums of triangle A132073.at n=13A132074
- Numbers m such that A132575(m) = m.at n=17A132579