16441
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16884
- Proper Divisor Sum (Aliquot Sum)
- 443
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16000
- Möbius Function
- 1
- Radical
- 16441
- 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
- 190
- 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
- Pseudoprimes to base 35.at n=33A020163
- Pseudoprimes to base 39.at n=32A020167
- Pseudoprimes to base 72.at n=38A020200
- Strong pseudoprimes to base 20.at n=10A020246
- Strong pseudoprimes to base 35.at n=8A020261
- Decimal part of n-th root of a(n) starts with digit 3.at n=35A034080
- Denominators of continued fraction convergents to sqrt(607).at n=11A042165
- Composite and every divisor (except 1) contains the digit 4.at n=6A062670
- a(n) = 2*prime(n)^2 - prime(n+1)^2.at n=33A064051
- Numbers k such that (2^k-3)*2^k+1 is prime.at n=21A096149
- a(n) = concatenation of (n times each digit of n).at n=40A111704
- Number of ordered quadruples (i,j,k,l) in range [0..n] satisfying i == j (mod 2), j == k (mod 3) and k == l (mod 4).at n=24A115523
- Integers of the form (x^4)/24 + (x^3)/6 + (x^2)/2 + x + 1 with x > 0.at n=7A127877
- 1 + 12*n + 81*n^3 + n*(105*n + 81*n^3)/2.at n=4A134163
- Number of n X 3 binary arrays with all 1s connected, a path of 1s from upper left corner to lower right corner, and no 1 having more than two 1s adjacent.at n=11A163686
- Least number k having n representations as the sum of the minimal number of biquadrates A002377(k).at n=10A185673
- G.f. satisfies: A(x) = 1 + x*A(x)^3 + x^2*A(x)^2 + x^3*A(x).at n=7A200029
- Number of cyclic subgroups of the group C_n x C_n x C_n x C_n, where C_n is the cyclic group of order n.at n=20A280184
- Least k such that at least half of the last n digits of 2^k are 9.at n=16A280660
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-2)^2, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=14A296257