5994
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 13794
- Proper Divisor Sum (Aliquot Sum)
- 7800
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1944
- Möbius Function
- 0
- Radical
- 222
- Omega Function (Ω)
- 6
- 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
- yes
- 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
- 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
- yes
- Odd
- no
Appears in sequences
- Number of lattices on n unlabeled nodes.at n=10A006966
- Triangle, T(n, k): T(n,k) = 1 for n < 3, T(3,1) = T(3,2) = T(3,3) = 2, T(n,0) = 1, T(n,1) = n-1, T(n,n) = T(n-1,n-2) + T(n-1,n-1), otherwise T(n,k) = T(n-1,k-2) + T(n-1,k-1) + T(n-1,k), read by rows.at n=75A026268
- Number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, s(1) = 1, s(n) = 2, |s(i) - s(i-1)| <= 1 for i >= 2, |s(2) - s(1)| = 1, |s(3) - s(2)| = 1 if s(2) = 1. Also T(n,n-2), where T is the array in A026268.at n=9A026288
- 9 times the triangular numbers A000217.at n=36A027468
- a(n) = 2*n*(4*n + 3).at n=27A033587
- 19-gonal (or enneadecagonal) numbers: n(17n-15)/2.at n=27A051871
- Numbers k such that (11*13^k -1)/2 is prime.at n=20A057471
- Triangle read by rows: number of commutative monoids of order n with k idempotents.at n=54A058142
- Numbers k such that (k + R(k)) / (k - R(k)) = +-11 where R(k) is the digit reversal of k (A004086).at n=7A062390
- a(n) = ceiling(a(n-1)/2) + a(n-2) with a(0)=0 and a(1)=1.at n=35A064651
- Numbers k such that Euler phi(k) / Carmichael lambda(k) = 18.at n=31A066697
- Smallest number m such that m and the product of digits of m are both divisible by 3n, or 0 if no such number exists.at n=53A073910
- Non-palindromic n and its digit reversal have the same sum of prime factors (with repetition).at n=22A085607
- a(n) = 6*(10^n - 1).at n=3A086577
- Numbers k for which the quotient q(k)=(k+rev(k))/abs(k-rev(k)) is an integer.at n=10A087993
- For each pair of twin primes (p,p+2) take the absolute value of the difference between p and p with digits reversed.at n=52A088489
- A bisection of A006966.at n=5A099085
- a(n) = 997*n + 1009.at n=5A100776
- a(n) = floor(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=100, a(2)=300.at n=14A104908
- Number of partitions that are "2-close" to being self-conjugate.at n=42A108961