5799
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7736
- Proper Divisor Sum (Aliquot Sum)
- 1937
- 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
- 3864
- Möbius Function
- 1
- Radical
- 5799
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 204
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Number of partially labeled rooted trees with n nodes (3 of which are labeled).at n=4A000444
- a(n) = floor(tau*a(n-1)) + a(n-2) with a(0)=0 and a(1)=1.at n=14A005821
- Triangle read by rows: T(n,k) is the number of partially labeled rooted trees with n vertices, k of which are labeled, 0 <= k <= n.at n=31A008295
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th number that is 1 or is not a Lucas number).at n=15A023497
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 1) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number).at n=16A023501
- a(n+1) = Sum_{k=0..floor(2*n/5)} a(k) * a(n-k).at n=16A030037
- 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 50.at n=26A031548
- Numbers whose set of base-12 digits is {3,4}.at n=18A032836
- a(1) = 3; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=35A033681
- Growth function of an infinite cubic graph (number of nodes at distance <=n from fixed node).at n=23A038621
- Numbers whose base-5 representation contains exactly three 1's and three 4's.at n=4A045262
- Cototient of 2^n - 1.at n=13A053288
- McKay-Thompson series of class 39C for Monster.at n=41A058661
- a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 4.at n=7A061516
- C(n+3)=2*C(n), where C(n) is Cototient(n) := n - phi(n) (A051953).at n=35A063480
- Half the number of 4 X n binary arrays with no path of adjacent 1's or adjacent 0's from top to bottom or side to side.at n=2A069449
- McKay-Thompson series of class 39C for the Monster group with a(0) = 1.at n=41A094362
- Number of self-polar configurations of type (n_3).at n=14A098702
- Triangular matrix T, read by rows, that satisfies: SHIFT_LEFT(column 0 of T^((3*p-1)/3)) = (3*p-1)*(column p of T), or [T^((3*p-1)/3)](m,0) = (3*p-1)*T(p+m,p) for all m>=1 and p>=0.at n=32A107717
- a(1) = 3, a(n) = least k such that concatenation of n copies of k with all previous concatenation gives a prime.at n=34A111473