16566
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 36288
- Proper Divisor Sum (Aliquot Sum)
- 19722
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5000
- Möbius Function
- 1
- Radical
- 16566
- Omega Function (Ω)
- 4
- 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
- 97
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that phi(k) | sigma_10(k).at n=18A015768
- 'Reverse and Add!' trajectory of 7059.at n=1A063057
- Integers n > 7059 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 7059.at n=34A063058
- Number of cycles in the n-th order prism graph.at n=11A077265
- Consider a number of k digits n = d_(k)*10^(k-1) + d_(k-1)*10^(k-2) + … + d_(2)*10 + d_(1). Sequence lists the numbers n such that phi(n) = Sum_{i=1..k-1}{sigma(Sum_{j=1..i}{d_(k-j+1)*10^(i-j)})} (see example below).at n=0A240901
- Number of length n+5 0..5 arrays with some three disjoint pairs in each consecutive six terms having the same sum.at n=4A248486
- T(n,k)=Number of length n+5 0..k arrays with some three disjoint pairs in each consecutive six terms having the same sum.at n=40A248489
- Number of length 5+5 0..n arrays with some three disjoint pairs in each consecutive six terms having the same sum.at n=4A248494
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 966", based on the 5-celled von Neumann neighborhood.at n=37A273837
- a(n) is the sum of quadratic nonresidues of A002145(n) (the n-th prime == 3 mod 4).at n=28A282036
- Let p = n-th prime == 3 mod 8; a(n) = sum of quadratic nonresidues mod p .at n=14A282726
- a(n) = 2^n - n + n^2.at n=14A290699
- Number of 4-cycles in the n-polygon diagonal intersection graph.at n=30A300552
- Number of excursions of length n with Motzkin-steps avoiding the consecutive steps UD, HH and DU.at n=20A329664
- Positive integers which can be written in two bases smaller than 10 as mutually-reversed strings of digit(s).at n=28A336733
- Irregular triangle where the n-th row list the positive integers which can be written in two bases smaller than n as mutually-reversed strings of digit(s), for n>=4.at n=55A336768