16595
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19920
- Proper Divisor Sum (Aliquot Sum)
- 3325
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13272
- Möbius Function
- 1
- Radical
- 16595
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 40
- 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
- In base 4, smallest number that requires n Reverse and Add! steps to reach a palindrome.at n=19A077441
- Number of prime pairs below 10^n having a difference of 56.at n=7A093982
- Numbers k such that Sum_{i=1..k} i^7 divides Product_{i=1..k} i^7.at n=17A166607
- Number of (n+2)X4 binary arrays avoiding patterns 001 and 100 in rows, columns and nw-to-se diagonals.at n=3A202585
- Number of (n+2)X6 binary arrays avoiding patterns 001 and 100 in rows, columns and nw-to-se diagonals.at n=1A202587
- T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 100 in rows, columns and nw-to-se diagonals.at n=11A202591
- T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 100 in rows, columns and nw-to-se diagonals.at n=13A202591
- Take a squarefree semiprime and take the difference of its prime factors. If it is a squarefree semiprime repeat the process. Sequence lists the squarefree semiprimes that generate other squarefree semiprimes only in the first k steps of this process. Case k = 4.at n=32A296811
- Partial sums of A299259.at n=26A299265
- Expansion of Sum_{k>=0} x^(k*(k+1)) / Product_{j=1..k} (1 - x^j)^j.at n=42A306664
- Number of ways to write n as an ordered sum of 5 nonprime numbers.at n=46A341482
- Numbers that are the sum of six fourth powers in four or more ways.at n=18A345561
- Numbers that are the sum of six fourth powers in exactly four ways.at n=17A345816