8449
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10368
- Proper Divisor Sum (Aliquot Sum)
- 1919
- 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
- 6720
- Möbius Function
- -1
- Radical
- 8449
- 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
- 57
- 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
- [ n(n-1)(n-2)(n-3)/17 ].at n=21A011927
- a(n) = floor(log(5)^n).at n=19A014216
- Pseudoprimes to base 72.at n=29A020200
- Numbers k such that the continued fraction for sqrt(k) has period 70.at n=30A020409
- Composite numbers whose prime factors contain no digits other than 1 and 7.at n=28A036307
- Numerators of continued fraction convergents to sqrt(66).at n=3A041114
- Numerators of continued fraction convergents to sqrt(264).at n=3A041494
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique value such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 3.at n=34A050032
- a(n) = a(n-1) + a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 2.at n=34A050048
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.at n=34A050064
- 17-gonal (or heptadecagonal) numbers: a(n) = n*(15*n-13)/2.at n=34A051869
- Product of all distinct nonzero numbers that can be formed from the digits of n.at n=16A061497
- Surround numbers of an n X 2 rectangle when n is even.at n=5A061524
- Integers n > 1997 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 1997.at n=9A063055
- Centered 16-gonal numbers.at n=32A069129
- Odd numbers k such that the number of 1's in binary representation of k equals omega(k), the number of distinct primes in the factorization of k.at n=21A071595
- Composite numbers k such that (k+1)*sigma(k) is a perfect square.at n=5A073586
- a(n) = a(n-1) + 64*a(n-2) starting with a(0) = 2 and a(1) = 1.at n=4A081708
- Triangle read by rows in which row n >= 1 gives coefficients in expansion of the polynomial Sum_{k=1..n} (1/n)*binomial(n,k)*binomial(n,k-1)*x^(2k)*(1+x)^(2n-2k) / x^2 in powers of x.at n=42A086873
- Square array T(M,N) read by antidiagonals: number of dimer tilings of a 2*M X 2*N Moebius strip.at n=23A103997