16450
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
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 35712
- Proper Divisor Sum (Aliquot Sum)
- 19262
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5520
- Möbius Function
- 0
- Radical
- 3290
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 115
- 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
- Fermat coefficients.at n=17A000970
- a(n) = floor(C(n,4)/5).at n=39A011795
- a(n) = T(n,5), array T as in A051168; a count of Lyndon words; aperiodic necklaces with 5 black beads and n-5 white beads.at n=35A051170
- Numbers k > 1 such that, in base 8, k and k^2 contain the same digits in the same proportion.at n=12A061662
- Denominators of the convergents of the continued fraction for Pi/sqrt(3) using the classical continued fraction for arctan(x).at n=4A123626
- a(n) = 686*n - 14.at n=23A157363
- Triangle of numbers generated by the Nekrasov-Okounkov formula.at n=32A210590
- Triangle read by rows of coefficients of polynomials generated by the Han/Nekrasov-Okounkov formula.at n=32A234937
- Binary representation of prime power divisors of n: Sum_{p^k | n} 2^(A065515(p^k)-1).at n=26A248906
- Number of (n+2)X(5+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.at n=3A262756
- T(n,k) = Number of (n+2) X (k+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.at n=31A262759
- Number of (4+2)X(n+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.at n=4A262761
- Divisors of 16450.at n=23A276465
- Expansion of r(q)^5 / r(q^5) in powers of q where r() is the Rogers-Ramanujan continued fraction.at n=24A285630
- Numbers n for which A019565(n) <= A087207(n) < n.at n=7A286612
- Number of nX3 0..1 arrays with every element unequal to 0, 1, 3, 4, 6 or 8 king-move adjacent elements, with upper left element zero.at n=12A316306
- Regular triangle where T(n,k) is the number of pairs of set partitions of {1,...,n} with join of length k.at n=24A318392
- a(n) = Sum_{d|n} phi(n/d)^(n-d).at n=7A342612
- a(n) = (1/(8*n)) * Sum_{d|n} mu(n/d) * binomial(8*d,d).at n=4A346582
- Numbers whose binary indices have (1) prime indices covering an initial interval and (2) squarefree product.at n=39A371293