3813
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5376
- Proper Divisor Sum (Aliquot Sum)
- 1563
- 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
- 2400
- Möbius Function
- -1
- Radical
- 3813
- 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
- 30
- 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
- Divisors of 2^20 - 1.at n=31A003529
- a(n) = round(n*phi^10), where phi is the golden ratio, A001622.at n=31A004945
- a(n) = ceiling(n*phi^10), where phi is the golden ratio, A001622.at n=31A004965
- Number of partitions of n in which no part occurs just once.at n=47A007690
- Coordination sequence T1 for Zeolite Code AWW.at n=44A008045
- Pseudoprimes to base 32.at n=40A020160
- a(n) = Sum_{k=1..n} floor((n/k)*floor(n/k)).at n=48A024921
- a(n) = Sum_{k=0..n} T(n,k), T given by A026780.at n=10A026787
- a(n) = n*(4*n-1).at n=31A033991
- Honaker's triangle problem: form a triangle with base of length n, all entries different, all row sums equal; a(n) gives minimal row sum.at n=28A047837
- a(n) = max_{r=1..n-1} ceiling(t(t(n)-t(r-1))/(n-r+1)), where t() = triangular numbers A000217.at n=28A047873
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the smallest integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = a(3) = 1.at n=32A050024
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=32A050040
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 1.at n=32A050056
- Numbers n such that 237*2^n-1 is prime.at n=29A050877
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 4.at n=43A051969
- Number of 3-rowed binary matrices with n ones and no zero columns, up to row and column permutation.at n=21A058053
- Number of states in minimal automaton that recognizes biquanimous numbers in base n.at n=11A065023
- The numbers D in the set {D :=(2n+1)^2-4m^2, 1<=m<=n} that generate the smallest solution x to x^2 - D*y^2 = 1.at n=37A074074
- Numbers k such that (68*10^(k-1) + 13)/9 is a depression prime.at n=11A082713