16510
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 32256
- Proper Divisor Sum (Aliquot Sum)
- 15746
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6048
- Möbius Function
- 1
- Radical
- 16510
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 172
- 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
- a(n) = 2*(2^n + 1)*(2^(n+1) - 1).at n=6A005367
- Number of ordered rooted trees with n non-root nodes and all outdegrees <= six.at n=10A036768
- a(n) = prime(n)*prime(n+1) - prime(n).at n=30A037166
- Self-convolution of 1 2 3 5 7 11 15 22 30 42 56 77 ... (A000041).at n=17A048574
- Number of partitions of 2n whose Ferrers-Young diagram allows more than one different domino tiling.at n=19A052837
- Number of reversible strings with n beads using exactly two different colors.at n=14A056309
- Number of irreducible polynomials over F_2 of degree at most n.at n=16A062692
- Zero, together with positive numbers k such that prime(k) - k is a square.at n=43A064370
- a(n) = (3*n+1)*(3*n+4).at n=42A085001
- Triangle read by rows: T(n,k), 0 <= k <= n, gives the coefficients of the Charlier polynomials (with parameter a=1), ordered by rising powers.at n=38A137338
- Weight distribution of [128,15,56] extended binary primitive BCH (or XBCH) code.at n=8A147633
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, 1), (0, 1), (1, -1), (1, 0), (1, 1)}.at n=9A151462
- Partial sums of floor(2^n/127).at n=19A178460
- Potential magic constants of 8 X 8 magic squares composed of consecutive primes.at n=36A189188
- Number of (n+1) X (6+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nonincreasing x(i,j)-x(i-1,j) in the j direction.at n=12A250740
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 3 5 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 3 5 6 or 7.at n=36A252384
- Number of (1+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 3 5 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 3 5 6 or 7.at n=8A252385
- Sum of the asymmetry degrees of all compositions of n with parts in {1,2,4,6,8,10,...}.at n=16A276054
- Triangle read by rows, coefficients of the polynomials P(m, n) = Sum_{k=1..n} binomial(m*n, m*k)* P(m, n-k)*z with P(m, 0) = 1 and m = 4.at n=12A278074
- Central coefficients of the polynomials defined in A278074.at n=2A281480