16683
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
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22848
- Proper Divisor Sum (Aliquot Sum)
- 6165
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10824
- Möbius Function
- -1
- Radical
- 16683
- 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
- 89
- 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 n such that n through n+5 have the same number of distinct prime factors.at n=19A045934
- Composites c whose decimal expansion ends with its largest prime factor.at n=40A050693
- Floor of area of triangle with consecutive prime sides.at n=43A096377
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+73)^2 = y^2.at n=10A129289
- Row sums of triangle A137629.at n=30A137630
- Sum_{j=k(n)..prime(n)} j where k is the n-th nonprime nonnegative integer.at n=42A161669
- Number of binary strings of length n with no substrings equal to 0000, 0011, or 1011.at n=22A164429
- T(n,k)=Number of (n*k)Xk binary arrays with nonzero rows in decreasing order, no more than 3 ones in any row and exactly n ones in every column.at n=31A188449
- Number of (4*n)Xn binary arrays with nonzero rows in decreasing order, no more than 3 ones in any row and exactly 4 ones in every column.at n=4A188452
- Integers n such that for all i > n the largest prime factor of i(i+1)(i+2)(i+3)(i+4)(i+5) exceeds the largest prime factor of n(n+1)(n+2)(n+3)(n+4)(n+5).at n=18A193947
- Number of nonnegative solutions to x^2 + y^2 + z^2 < n^2.at n=31A218711
- Number of length n+3 0..6 arrays with some disjoint pairs in every consecutive four terms having the same sum.at n=5A247531
- Number of length 6+3 0..n arrays with some disjoint pairs in every consecutive four terms having the same sum.at n=5A247538
- Number A(n,k) of factorizations of m^n into at most n factors, where m is a product of exactly k distinct primes; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=39A256384
- Number of factorizations of m^3 into at most 3 factors, where m is a product of exactly n distinct primes.at n=5A256493
- Numbers n for which A324108(n) = A324054(n-1) and which are neither prime powers nor of the form 2^i * p^j, where p is an odd prime, with either exponent i or j > 0.at n=12A324111
- Odd numbers n for which A324108(n) = A324054(n-1), and which themselves are not powers of primes (in A000961).at n=2A324112
- a(n) is the nearest integer to the area of a triangle with sides prime(n), prime(n+1), prime(n+2).at n=43A338267