5865
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 10368
- Proper Divisor Sum (Aliquot Sum)
- 4503
- 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
- 2816
- Möbius Function
- 1
- Radical
- 5865
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 103
- 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
- 9-gonal (or enneagonal) pyramidal numbers: a(n) = n*(n+1)*(7*n-4)/6.at n=17A007584
- Pseudoprimes to base 47.at n=41A020175
- a(n) = n*(13*n + 1)/2.at n=30A022271
- Squarefree odd numbers with exactly 4 distinct prime factors.at n=30A046390
- Minimal value w such that A051953(w) = w - phi(w) is prime and w has n prime divisors.at n=3A051999
- Terms of A050530 with four prime divisors.at n=0A053340
- Add column entries of the table with rows (1,2,0,0...), (0,3,4,5,0,0...), (0,0,6,7,8,9,0,0...), (0,0,0,10,11,12,13,14,0,0...), ...at n=32A064694
- Nonsquares with A072594(n) = 0.at n=15A072596
- Odd composite numbers k such that cototient(k) - phi(k) = k - 2*phi(k) is an odd prime.at n=3A083255
- Map from binary trees of size n to the set of corresponding trivalent plane trees (tpt) represented as size 2n+1 general trees.at n=18A083930
- First differences of A084449.at n=27A084465
- Odd squarefree numbers k such that k/phi(k) > 2, where phi is Euler's totient function.at n=32A091495
- 45-gonal numbers: n*(43*n-41)/2.at n=16A098924
- Next term is the sum of previous term and the square of the sum of its decimal digits, with a(0) = 10.at n=22A112787
- Primitive elements of A119432.at n=11A119433
- Expansion of g.f. x*(x^4 - 5*x^3 + 10*x^2 - 12*x + 4)/((1-x)^2*(1 - 3*x + 2*x^2 - x^3)).at n=10A129080
- Maximum number of points visible from some point in a cubic n x n x n lattice.at n=18A141227
- Odd squarefree numbers n such that the cyclotomic polynomial Phi(n,x) has height 4.at n=21A152942
- a(n) = 36*n^2 - 17*n + 2.at n=12A157265
- A recursion triangle sequence: A(n,k) = A(n-1,k-1)+e(n-1,k) where e(n,k)=Sum[(-1)^j Binomial[n + 1, j](k - j)^n, {j, 0, k}].at n=51A157744