10444
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 20944
- Proper Divisor Sum (Aliquot Sum)
- 10500
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4464
- Möbius Function
- 0
- Radical
- 5222
- Omega Function (Ω)
- 4
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 55
- Smith Number
- no
- 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
- Atkinson-Negro-Santoro sequence: a(n+1) = 2*a(n) - a(n-floor(n/2+1)).at n=15A005255
- Numbers having three 4's in base 10.at n=36A043507
- Numbers k such that A000010(k) divides A074639(k).at n=44A074645
- Recursively defined polynomials, read by row.at n=47A109086
- Lesser of twin admirable numbers: k such that k and k+2 are both admirable numbers.at n=36A109730
- a(1) = a(2) = a(3) = 1; for n>3, a(n) = a(n-1) + a(n-2) + a(n-3) iff n-1 is prime, otherwise a(n) = a(n-1) + 1.at n=30A113057
- Numbers k such that for any single digit d of k the d-th semiprime sp(k) is substring of k.at n=34A135441
- Triangle T(n,k) read by rows: the coefficient [x^k] of the polynomial (n-1)! *sum_{i=0..n} Fibonacci(i)*binomial(x,n-i), read by rows, 0<=k<n.at n=30A139167
- Number of maximal self-avoiding walks from NW to SW corners of a 5 X n grid.at n=8A181689
- Smallest number with n nonprime substrings (Version 2: substrings with leading zeros are counted as nonprime if the corresponding number is > 0).at n=14A213303
- Smallest number with n nonprime substrings (Version 3: substrings with leading zeros are counted as nonprime if the corresponding number is not a prime).at n=14A213304
- Number n such that the sum of its proper evil divisors (A001969) equals n.at n=17A230587
- Number of ON cells at n-th stage in simple 2-dimensional cellular automaton (see Comments lines for definition).at n=55A256534
- Number of nX5 0..n*5-1 arrays with upper left zero and lower right n*5-1 and each element differing from its horizontal, diagonal and antidiagonal neighbors by a power of two.at n=1A265634
- T(n,k) is the number of n X k 0..n*k-1 arrays with upper left zero and lower right n*k-1 and each element differing from its horizontal, diagonal and antidiagonal neighbors by a power of two.at n=16A265635
- Number of 2 X n 0..2*n-1 arrays with upper left zero and lower right 2*n-1 and each element differing from its horizontal, diagonal and antidiagonal neighbors by a power of two.at n=4A265636
- The difference between the two largest distinct parts of a partition (0 if no distinct parts), summed over all partitions of n.at n=25A268191
- Partial sums of A299258.at n=23A299264
- Number of n X 2 0..1 arrays with every element unequal to 0, 2, 3 or 4 king-move adjacent elements, with upper left element zero.at n=8A303882
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 2, 3 or 4 king-move adjacent elements, with upper left element zero.at n=46A303888