3797
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 3798
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3796
- Möbius Function
- -1
- Radical
- 3797
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 38
- 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
- 528
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Expansion of (1+x^3)/((1-x)*(1-x^2)^2*(1-x^3)).at n=49A001973
- a(n) = 2^n - C(n,0) - C(n,1) - C(n,2) - C(n,3).at n=12A002663
- a(n) = Sum_t t*F(n,t), where F(n,t) (see A033185) is the number of rooted forests with n (unlabeled) nodes and exactly t rooted trees.at n=9A005197
- Mian-Chowla sequence (a B_2 sequence): a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the pairwise sums of elements are all distinct.at n=44A005282
- Number of planted binary phylogenetic trees with n labels.at n=5A006677
- Coordination sequence T3 for Zeolite Code TON.at n=38A008243
- a(n) = Sum_{k=0..8} binomial(n,k).at n=12A008861
- a(n) = prime(n*(n+1)/2).at n=31A011756
- Numbers such that every prefix and suffix is 1 or a prime.at n=27A012884
- Powers of fifth root of 6 rounded down.at n=23A018129
- Powers of fifth root of 6 rounded to nearest integer.at n=23A018130
- Numbers k such that the continued fraction for sqrt(k) has period 13.at n=23A020352
- Primes that are both left-truncatable and right-truncatable.at n=13A020994
- Primes that remain prime through 3 iterations of function f(x) = 6x + 5.at n=32A023288
- Right-truncatable primes: every prefix is prime.at n=37A024770
- Substrings from the right are prime numbers (using only odd digits different from 5).at n=25A032437
- a(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k^(1/10) starts with n.at n=28A034075
- Decimal part of cube root of a(n) starts with 6: first term of runs.at n=13A034132
- Number of partitions of n into parts not of the form 13k, 13k+5 or 13k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 5 are greater than 1.at n=31A035953
- a(n)=T(n,n+3), array T as in A049723.at n=33A049731