8874
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 21060
- Proper Divisor Sum (Aliquot Sum)
- 12186
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2688
- Möbius Function
- 0
- Radical
- 2958
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 21
- Smith Number
- yes
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Molien series for Conway group Con.0.at n=37A008925
- Every run of digits of n in base 16 has length 2.at n=39A033014
- Numbers whose concatenation of prime factors (with multiplicity) is a square.at n=23A038693
- Numbers whose base-2 representation has exactly 12 runs.at n=13A043579
- Difference between length (A005341) and sum of digits (A004977) of n-th term in Look and Say Sequence (A005150).at n=33A056635
- a(n) = Sum_{k=1..n} phi(k)^2.at n=39A057434
- Numbers of the form (10*a + b)^2 + (10*b + a)^2 with a and b less than 10, in numerical order.at n=39A061191
- a(n) = prime(n) + prime(n^2).at n=32A092504
- a(n) = n*(n+1)*(n^2 + 21*n + 50)/24.at n=16A101854
- Numbers k such that 2^(2*k+1) + 2^k + 1 is prime.at n=33A105180
- Numbers k such that k^2 is the concatenation of two numbers m and m+2.at n=0A115427
- Numbers k such that k and k^2 use only the digits 0, 4, 6, 7 and 8.at n=13A136954
- Numbers k such that k and k^2 use only the digits 1, 4, 6, 7 and 8.at n=11A137052
- Numbers k such that k and k^2 use only the digits 2, 4, 6, 7 and 8.at n=23A137101
- Numbers k such that k and k^2 use only the digits 3, 4, 6, 7 and 8.at n=6A137127
- Numbers k such that k and k^2 use only the digits 4, 5, 6, 7 and 8.at n=13A137140
- Numbers k such that k and k^2 use only the digits 4, 6, 7 and 8.at n=2A137144
- Numbers k such that k and k^2 use only the digits 4, 6, 7, 8 and 9.at n=10A137145
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0) and consisting of n steps taken from {(-1,-1), (-1,1), (-1,0), (0,1), (1,0), (1,1)}.at n=6A151322
- Triangle of coefficients of polynomials v(n,x) jointly generated with A210751; see the Formula section.at n=42A210752