16887
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 6
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 24304
- Proper Divisor Sum (Aliquot Sum)
- 7417
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10368
- Möbius Function
- -1
- Radical
- 16887
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 110
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers whose base-5 representation contains exactly three 0's and three 2's.at n=14A045187
- Numbers with multiplicative persistence value 6.at n=14A046515
- Squarefree n such that the elliptic curve n*y^2 = x^3 - x arising in the "congruent number" problem has rank 3.at n=28A062693
- a(n) = 100*n^2 - n.at n=12A157659
- a(n) = 169*n^2 - 13.at n=9A158550
- Composite numbers whose multiplicative persistence is 6.at n=13A199996
- Number of 5-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero.at n=10A208826
- Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal and vertical neighbors in a random 0..2 n X 2 array.at n=6A217451
- Number of nX7 arrays of the minimum value of corresponding elements and their horizontal and vertical neighbors in a random 0..2 nX7 array.at n=1A217456
- T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal and vertical neighbors in a random 0..2 nXk array.at n=29A217457
- T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal and vertical neighbors in a random 0..2 nXk array.at n=34A217457
- T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..2 nXk array.at n=34A219128
- Number of 7Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..2 7Xn array.at n=1A219134
- Number of emirps of length ceiling(n/4)+1 and leading digit 1, 3, 7 or 9 (in sequence).at n=23A220349
- Number of (n+2) X (2+2) 0..3 arrays with every consecutive three elements in every row and column having exactly two distinct values, and in every diagonal and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=7A252689
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every consecutive three elements in every row and column having exactly two distinct values, and in every diagonal and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=37A252695
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every consecutive three elements in every row and column having exactly two distinct values, and in every diagonal and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=43A252695
- Number of multisets of nonempty words with a total of n letters over binary alphabet containing the second letter such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=11A293797
- Numbers that can be represented in more than one way as p^2+p*q+q^2 with p and q primes, p<=q.at n=15A349987
- G.f. satisfies A(x) = 1 + x * A(x * (1 + x^2)).at n=14A360885