16165
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20088
- Proper Divisor Sum (Aliquot Sum)
- 3923
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12480
- Möbius Function
- -1
- Radical
- 16165
- 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
- 146
- 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
- Numbers k such that sigma(k) = sigma(k+10).at n=22A015880
- Numbers k such that 2^(2*(k+1)) + 2^k - 1 is prime.at n=35A105181
- Number of words with n letters in the National Scrabble Association Dictionary.at n=9A124015
- Primitive subsequence of A111105.at n=29A137559
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, -1, 1), (-1, 0, -1), (1, -1, 1), (1, 1, 0)}.at n=9A149099
- Number of binary strings of length n with no substrings equal to 0000 0110 or 0111.at n=18A164438
- a(n) is the number of representative four-color bracelets (necklaces with turning over allowed) with n beads, for n >= 4.at n=7A214309
- a(n) = Sum_{k=0..3} f(n+k)^2 where f=A130519.at n=22A238604
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 718", based on the 5-celled von Neumann neighborhood.at n=36A273427
- 10*n analog to Keith numbers.at n=20A282765
- Expansion of Product_{k>=1} (1 - p(k)*x^k), where p(k) = number of partitions of k (A000041).at n=31A304785
- Number of squarefree parts in the partitions of n into 9 parts.at n=37A309463
- a(n) is the constant term in expansion of Product_{k=1..n} (x^(k^2) + 1 + 1/x^(k^2)).at n=15A350249
- Squared length of diagonal of right trapezoid with three consecutive prime length sides.at n=30A360790
- Number of partitions of [2n] whose block maxima sum to 3n.at n=14A365441
- The smallest positive number such that sopfr(|a(n) - n|) = sopfr(a(n) + n) and Omega(|a(n) - n|) = Omega(a(n) + n), where sopfr(k) is the sum of the primes dividing k, with repetition.at n=18A370504
- G.f.: Sum_{k>=0} x^k * Product_{j=1..2*k} (1 + x^j)/(1 - x^j).at n=22A385088