16754
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 25134
- Proper Divisor Sum (Aliquot Sum)
- 8380
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8376
- Möbius Function
- 1
- Radical
- 16754
- 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
- 159
- 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
- yes
- Odd
- no
Appears in sequences
- Four-fold convolution of primes with themselves.at n=6A014344
- Number of 1's in n-th term of A022482.at n=34A022484
- All differences C(j)-C(i), j>i, of Catalan numbers A000108.at n=41A047075
- Numbers k such that 9^k + 2 is prime.at n=20A090649
- Numbers k such that 2*10^k + 6*R_k - 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=21A098959
- a(n) = Sum_{k=0..n-1} (105k+44)*C(2k,k)^2*T(k)*(-1)^(n-1-k)/(2n*C(2n,n)), where T(k) (k=0,1,2,...) are central trinomial coefficients given by A002426.at n=4A181147
- a(n) = C(n) if n is odd, else C(n) - C(n/2); C(n) are Catalan numbers.at n=9A187916
- Number of primes of the form (x+1)^5 - x^5 less than 10^n.at n=22A221846
- Number of partitions p of n such that median(p) < multiplicity(max(p)).at n=53A240207
- Triangle T(n,k) whose k-th column is the k-fold self-convolution of the primes; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=59A340991
- Number of integer partitions of n that are empty, have smallest part not dividing all the others, or greatest part not divisible by all the others.at n=36A343346
- a(n) is the number of consecutive even prime gap pairs (g1, g2) satisfying g1 == 0 (mod 6) and g2 == 2 (mod 6) out of the first 2^n consecutive even prime gap pairs.at n=17A345333