16704
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 42
- Divisor Sum
- 49530
- Proper Divisor Sum (Aliquot Sum)
- 32826
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5376
- Möbius Function
- 0
- Radical
- 174
- Omega Function (Ω)
- 9
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 35
- 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
- Expansion of theta series of {E_7}* lattice in powers of q^(1/2).at n=28A003781
- Expansion of theta series of E_7 lattice in powers of q^2.at n=7A004008
- a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2,3; |s(i) - s(i-1)| <= 1 for i >= 4, s(n) = 2. Also a(n) = T(n,n-2), where T is the array defined in A026082.at n=8A026085
- Nonzero coefficients in theta series of {E_7}* lattice.at n=14A030443
- Theta series of lattice A_2 tensor D12+ (dimension 24, min norm 4).at n=3A037190
- Sums of 3 distinct powers of 4.at n=44A038471
- Numbers k such that 2*10^k + R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=17A056700
- Numbers k such that sigma (x) = k has exactly 12 solutions.at n=17A060676
- Expansion of 1 / ((1-x)*(1-x+x^2+x^3)).at n=35A077872
- Expansion of (1-x)^(-1)/(1+x+x^2-x^3).at n=37A077908
- Start with x=6/5; repeatedly apply the map x -> x*ceiling(x); sequence gives numerators of the resulting sequence of fractions.at n=4A117596
- G.f.: Sum_{n>=0} A155585(n)^2 * log(1/(1-2*x))^n/n!, where 1/(1-2*x+2*x^2) = Sum_{n>=0} A155585(n)*log(1/(1-2*x))^n/n!.at n=8A167532
- Numbers with 42 divisors.at n=13A175750
- Numbers of the form p^6*q^2*r where p, q, and r are distinct primes.at n=12A179703
- The number of bijections f:{1,...,n}->Z/nZ such that f(ab)=f(a)+f(b) whenever all three function values are defined.at n=19A179989
- Number of n X n 0..3 arrays with each element equal to either the sum mod 4 of its horizontal and vertical neighbors or the sum mod 4 of its diagonal and antidiagonal neighbors.at n=3A183535
- Number of nX4 0..3 arrays with each element equal to either the sum mod 4 of its horizontal and vertical neighbors or the sum mod 4 of its diagonal and antidiagonal neighbors.at n=3A183538
- T(n,k)=Number of nXk 0..3 arrays with each element equal to either the sum mod 4 of its horizontal and vertical neighbors or the sum mod 4 of its diagonal and antidiagonal neighbors.at n=24A183541
- Number of 3 X 3 0..n arrays with row and column sums one greater than the previous row and column.at n=7A202865
- Number of (w,x,y,z) with all terms in {1,...,n} and w <= (geometric mean of x,y,z).at n=14A212143