16193
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16194
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16192
- Möbius Function
- -1
- Radical
- 16193
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 66
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1883
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Shifts left 2 places under Stirling2 transform.at n=9A007469
- Sum along upward diagonal of Pascal triangle to center.at n=21A010752
- Numbers k such that the continued fraction for sqrt(k) has period 93.at n=11A020432
- a(n) = T(n,m) + T(n,m+1) + ... + T(n,n), where m=[ (n+1)/2 ], T given by A026725.at n=14A026847
- a(n) = T(n,n-3), array T as in A038738.at n=7A038740
- Number of rooted trees with n nodes with every leaf at height 3.at n=24A048808
- n-th occurrence of gap of n between primes occurs at prime a(n), n even, n >= 2.at n=11A054587
- Enomial primes of order 6: primes of the form 2*x^6 + 7*x^5 + 1*x^4 + 8*x^3 + 2*x^2 + 8*x + 1 for positive integer x.at n=3A078115
- Primes which are the sum of three positive 4th powers.at n=27A085318
- Primes p such that q-p = 24, where q is the next prime after p.at n=23A098974
- Primes of the form 128n+65.at n=33A105129
- Row sums of A059346.at n=9A106640
- a(n) = Sum_{i=0..n} binomial(2*n+i,n-i).at n=7A108080
- prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 7.at n=34A109561
- a(n) = (n^6 - 126*n^5 + 6217*n^4 - 153066*n^3 + 1987786*n^2 - 13055316*n + 34747236)/36.at n=34A121888
- Primes p of the form a^4+b^4+c^4 with a,b,c>=1 such that a^2+b^2+c^2 is another prime < p.at n=20A126117
- Prime numbers that are the sum of three distinct positive fourth powers.at n=15A126657
- Primes of the form 210k + 23.at n=38A140844
- Primes congruent to 25 mod 47.at n=37A142376
- Primes congruent to 28 mod 53.at n=32A142558