8247
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
- 4
- Divisor Sum
- 11000
- Proper Divisor Sum (Aliquot Sum)
- 2753
- 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
- 5496
- Möbius Function
- 1
- Radical
- 8247
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 96
- 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
- Number of basic invariants for cyclic group of order and degree n.at n=19A002956
- a(n) = Sum_{k=1..n} k*phi(k).at n=33A011755
- Minimal number of people to give a 50% probability of having at least n coincident birthdays in one year.at n=37A014088
- 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=40A029580
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 60.at n=28A031558
- Floor( n(n+1)(n+2)...(n+7) / (n+(n+1)+(n+2)+...+(n+7)) ).at n=2A032777
- a(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k^(1/11) starts with n.at n=27A034076
- Expansion of Sum_{n>=0} (q^n / Product_{k=1..n+4} (1 - q^k)).at n=28A035300
- Maximal number of 132 patterns in a permutation of 1,2,...,n.at n=47A061061
- Indices of prime generalized tetranacci numbers, A073817.at n=22A104577
- Floor(Zeta(3)^n).at n=48A125890
- T(n,k) = (q*Sum_{j=0..k+1} (-1)^j*binomial(n+1, j)*(k+1-j)^n - p*binomial(n-1, k))/2 where p=12 and q=14.at n=23A141697
- T(n,k) = (q*Sum_{j=0..k+1} (-1)^j*binomial(n+1, j)*(k+1-j)^n - p*binomial(n-1, k))/2 where p=12 and q=14.at n=25A141697
- Binomial transform of [1, 4, 10, 20, 0, 0, 0, ...].at n=14A143131
- 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, 1), (-1, 0, 1), (-1, 1, 0), (0, 1, -1), (1, 0, 0)}.at n=9A148593
- Partial sums of A023201.at n=44A172295
- a(n) = ceiling(A003269(n)/2).at n=33A173674
- Triangle read by rows: T(n,k) is the number of 2-compositions of n having k even entries in the top row. A 2-composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n.at n=47A181336
- Inverse permutation to A190130.at n=39A190131
- G.f. satisfies A(x) = (1 + x*A(x)) * (1 + 2*x*A(x)^2).at n=5A216314