16098
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 32208
- Proper Divisor Sum (Aliquot Sum)
- 16110
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 5364
- Möbius Function
- -1
- Radical
- 16098
- 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
- 71
- Smith Number
- yes
- 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
- Quadruples of different integers from [ 2,n ] with no common factors between pairs.at n=44A015628
- Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^18 in powers of x.at n=6A047643
- Numbers n such that 4*10^n + 7*R_n - 6 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=5A102995
- Number of ways to move a chess queen from the lower left corner to square (n,n), with the queen moving only up, right, or diagonally up-right.at n=5A132595
- Sum of first n terms divides the concatenation of the first n terms.at n=15A166064
- a(n) = prime(n)^2 - n.at n=30A182174
- Number of (1,0)-steps at levels 1,3,5,... in all peakless Motzkin paths of length n.at n=13A190169
- Number A(n,k) of lattice paths from {n}^k to {0}^k using steps that decrement one component or all components by the same positive integer; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=33A229345
- T(n,k)=Number of length n+2 0..k arrays with the sum of the maximum minus the median of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=47A251935
- Number of length 3+2 0..n arrays with the sum of the maximum minus the median of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=7A251937
- Numbers k such that (13*10^k + 83) / 3 is prime.at n=21A276322
- Expansion of 1/(1 - x*(1 + theta_3(x))/2), where theta_3() is the Jacobi theta function.at n=19A302018
- G.f.: Product_{k>=1} Sum_{n>=0} x^(k*n) / (1 - x^(n+k)).at n=21A341959