16711
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17712
- Proper Divisor Sum (Aliquot Sum)
- 1001
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 15712
- Möbius Function
- 1
- Radical
- 16711
- 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
- 141
- 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
- Number of unlabeled minimally 2-connected graphs with n nodes (also called "blocks").at n=12A003317
- Numbers k such that 279*2^k + 1 is prime.at n=23A053356
- First differences of Stern's sequence A005230.at n=16A066777
- To get a(m), replace each digit of a(m-1) with the sum of all digits to the left of that digit.at n=14A110403
- Years >= 1801 in which Christmas falls in Sukkot.at n=33A222419
- G.f.: Sum_{n>=0} binomial((n+1)^2, n)/(n+1) * x^n / (1 + x)^((n+1)^2).at n=5A299435
- Number of 4Xn 0..1 arrays with every element equal to 0, 2, 3 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=8A302462
- Expansion of Product_{k>=1} (1 + x^k)^(q(k)-1), where q(k) = number of partitions of k into distinct parts (A000009).at n=28A305651
- Size of the support of the Kaplan-Meier product-limit estimator indexed by sample size n.at n=17A362785