5943
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9088
- Proper Divisor Sum (Aliquot Sum)
- 3145
- 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
- 3384
- Möbius Function
- -1
- Radical
- 5943
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 49
- 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 k such that k, k+1, k+2 and k+3 have the same number of divisors.at n=3A006601
- a(n) = n*(27*n - 1)/2.at n=21A022284
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 11.at n=43A031509
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 11.at n=6A031689
- Number of partitions of n into parts not of form 4k+2, 12k, 12k+3 or 12k-3.at n=56A036018
- Sets of 4 consecutive numbers with equal number of divisors.at n=12A039665
- Number of terms (excluding the first) of A002211 for which the geometric mean produces progressively better approximations to Khinchin's constant (itself).at n=22A048613
- Integers n > 879 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 879.at n=30A063052
- Record entries in A065191.at n=40A065192
- Triangle, read by rows, of the coefficients of [x^k] in G100231(x)^n such that the row sums are 5^n-1 for n>0, where G100231(x) is the g.f. of A100231.at n=32A100232
- If n==0 (mod 3) then a(n)=a(n-1); if n==1 (mod 3) then a(n)=a(n-2)+a(n-3); if n==2 (mod 3) then a(n)=a(n-3)+a(n-4)+a(n-5).at n=31A104204
- Triangle read by rows: matrix inverse of A110877.at n=50A126126
- Least common multiple of 3 and n^2+n+1.at n=44A130723
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (-1, 1, 1), (0, 0, 1), (1, -1, 1), (1, 1, -1)}.at n=8A148494
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (0, -1, 1), (1, 1, -1), (1, 1, 1)}.at n=7A149733
- Numbers n such that n, n+1 and n+2 have the same number of divisors, and that number of divisors is larger than 4.at n=39A171666
- a(n) = 121*n^2 + 2*n.at n=6A181679
- a(n) = n*(14*n - 11).at n=21A195021
- a(n) = (n-2)*(14*n-39) for n > 2, otherwise a(n) = n.at n=23A195030
- a(1)=11; a(n) = floor((2 + sqrt(8))*a(n-1)) for n > 1.at n=4A196468