5841
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 9360
- Proper Divisor Sum (Aliquot Sum)
- 3519
- 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
- 3480
- Möbius Function
- 0
- Radical
- 1947
- Omega Function (Ω)
- 4
- 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
- 80
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Triangular numbers written backwards.at n=54A004158
- Number of strict first-order maximal independent sets in path graph.at n=30A007383
- Define the generalized Pisot sequence T(a(0),a(1)) by: a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n). This is T(3,6).at n=13A018918
- Pisot sequences E(6,8), P(6,8).at n=24A020716
- Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-4).at n=30A023434
- [ (4th elementary symmetric function of S(n))/(2nd elementary symmetric function of S(n)) ], where S(n) = {first n+3 odd positive integers}.at n=14A024205
- Number of distinct products ijk with 0 <= i < j < k <= n.at n=47A027429
- Numbers k such that 113*2^k+1 is prime.at n=16A032406
- a(n) = (2*n+1)*(11*n+1).at n=16A033575
- a(n) = Sum{a(k): k=0,1,2,...,n-4,n-2,n-1}; a(n-3) is not a summand; initial terms are 0,3,4.at n=14A049863
- 13-gonal (or tridecagonal) numbers: a(n) = n*(11*n - 9)/2.at n=33A051865
- Numbers with more than one factorization into S-primes. See A054520 and A057948 for definition.at n=34A057949
- Numbers primitive with respect to having more than one factorization into S-primes. See related sequences for definition.at n=29A057950
- Euler transform of A002487.at n=18A071019
- a(1) = 7; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=36A074343
- Expansion of 1/((1-2*x+x^2-x^3)*(1-x)).at n=14A077855
- Numbers k such that (k! + 3)/3 is prime.at n=19A089085
- Number of distinct lines through the origin in the n-dimensional lattice of side length 8.at n=4A090024
- Number of distinct lines through the origin in 4-dimensional cube of side length n.at n=8A090026
- Partial sums of A107947.at n=38A107957