8229
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11872
- Proper Divisor Sum (Aliquot Sum)
- 3643
- 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
- 5040
- Möbius Function
- -1
- Radical
- 8229
- 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
- no
- Odd
- yes
Appears in sequences
- Truncated square numbers: 7*n^2 + 4*n + 1.at n=34A005892
- a(n+1) = [ A*a(n)+B ]/p^r, where p^r is the highest power of p diving [ A*a(n)+B ] and p=2, A=2.00013, B=3.0.at n=31A029580
- Number of partitions satisfying cn(1,5) <= cn(0,5) + cn(2,5) and cn(1,5) <= cn(0,5) + cn(3,5) and cn(4,5) <= cn(0,5) + cn(2,5) and cn(4,5) <= cn(0,5) + cn(3,5).at n=38A039874
- Numerators of continued fraction convergents to sqrt(979).at n=6A042894
- a(n)^2 is a square whose digits occur with an equal minimum frequency of 2.at n=34A052049
- Expansion of (1-x)/(1-x-x^3-x^4+x^5).at n=25A052532
- a(n) = a(n-1) + the number of primes <= a(n-1).at n=39A061535
- Smallest multiple of the n-th prime such that the n-th partial sum is divisible by n.at n=46A074105
- Numbers k such that p(k), p(k)+6, p(k)+12, p(k)+18 are consecutive primes, where p(k) denotes k-th prime.at n=30A090832
- Numbers n such that if p=prime(n), then p, p+6, p+12, p+18 are consecutive primes with p=6*k+5 for some k, where prime(n) denotes n-th prime.at n=15A090835
- Number of partitions of 2*n into distinct parts with exactly two odd parts.at n=31A096914
- Number of unimodal compositions of n+2 where the maximal part appears exactly twice.at n=24A114921
- Number of squares on infinite chessboard that a knight can reach in n moves from a fixed square.at n=34A118312
- Number of rooted n-edge one-vertex one-face maps on a non-orientable surface (of genus n).at n=4A118450
- Numbers k which divide the sum of the Fibonacci numbers F(1) through F(k) and such that k is not a multiple of 24.at n=11A124456
- a(n) = 7*n^2 + 4*n + 1.at n=35A135704
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 1000-1000-1111-0100 pattern in any orientation.at n=14A147121
- a(n) = 242*n + 1.at n=33A157958
- a(n) = 484*n + 1.at n=16A158326
- a(n) = 68*n^2 + 1.at n=11A158732