8441
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8832
- Proper Divisor Sum (Aliquot Sum)
- 391
- 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
- 8052
- Möbius Function
- 1
- Radical
- 8441
- 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
- 57
- 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
- Largest number not the sum of distinct n-th-order polygonal numbers.at n=27A007419
- a(n) = Sum_{k=0..n-1} T(n,k) * T(n,2n-k), with T given by A027113.at n=6A027136
- Number of ways to partition n elements into pie slices each with at least 2 elements allowing the pie to be turned over.at n=26A032278
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A049747.at n=37A049750
- Numbers n such that n = pi(n)*k + 1 for some k.at n=24A065136
- a(n) = n^3 + (n+1)^2.at n=20A100705
- Indices of primes in sequence defined by A(0) = 81, A(n) = 10*A(n-1) + 31 for n > 0.at n=13A101066
- Semiprimes k=p*q such that the polynomial (1+x)^k (mod k) has p+q nonzero terms.at n=32A116926
- Sum of third powers of three consecutive primes.at n=4A133530
- Numbers which are the sum of 3 cubes of distinct odd primes.at n=24A138853
- a(n) = 16*n^2 - n.at n=22A157446
- One-eighth of triangular numbers (integers only).at n=45A157716
- a(n) = 529*n^2 - 23.at n=3A158633
- Number of n X n symmetric 0..5 arrays with rows, considered as 6-ary numbers, in nondecreasing order.at n=2A162081
- Multiples of 23 whose digit reversal + 1 is also a multiple of 23.at n=12A166393
- a(n) = 5*n^2 + 11*n + 1.at n=40A172044
- 1/9 the number of (n+1) X (n+1) 0..2 arrays with all 2 X 2 subblocks having the same four values.at n=10A184040
- Number of strings of numbers x(i=1..n) in 0..2 with sum i^3*x(i)^2 equal to n^3*4.at n=18A184296
- 18k^2-12k-7 interleaved with 18k^2+6k+5 for k>=0.at n=44A216853
- Number of partitions p of n such that (number of numbers of the form 5k + 2 in p) is a part of p.at n=34A241551