8446
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13104
- Proper Divisor Sum (Aliquot Sum)
- 4658
- 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
- 4080
- Möbius Function
- -1
- Radical
- 8446
- 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
- 158
- 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
- yes
- Odd
- no
Appears in sequences
- 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=33A050032
- 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=33A050048
- 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=33A050064
- Numbers k such that k*(k+5) gives the concatenation of two numbers m and m+9.at n=0A116351
- a(n+1) = a(n) + (if a(n) is odd then (next odd square) else (next even square)), a(0) = 1.at n=19A116955
- 1/4 the number of (n+1) X (n+1) binary arrays with all 2 X 2 subblock sums the same.at n=12A183977
- a(n) = n*(5*n+1).at n=41A202803
- Number of (n+1) X (7+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nonincreasing x(i,j)-x(i-1,j) in the j direction.at n=11A250741
- Number of even parts in the partitions of n into 6 parts.at n=44A309551
- Number of separable partitions of n in which the number of distinct (repeatable) parts is 4.at n=41A325648
- Number of compositions of n whose run-lengths are all different.at n=24A329739
- Irregular table: the n-th row polynomial is given by the formal power series expansion of Sum_{k >= 0} (1 + q)^(n*k + n^2)*Product_{j = 1..k} (1 - (1 + q)^(2*j-1)), n >= 1.at n=28A340882
- a(n) is the rank of the US English name of n when all its letters are written in all possible orders and arranged in alphabetic order.at n=13A351025
- Column 1 of triangle A370041.at n=34A370154